Introduction Let's draw some regular hexagons formed by hexagonal tiles, marking the vertices of the tiles with dots. Then we will count the number of dots. size 1: 6 dots . . . . . . size 2: 24 dots . . . . . . . . . . . . . . . . . . . . . . . . size 3: 54 dots ...

Potential nonzero entries in A338268 code-golf math integer sequence Background A338268 is a sequence related to a challenge by Peter Kagey. It defines a two-parameter function \$T(n,k)\$, which counts the number of integer sequences \$b_1, \cdots, b_t\$ where \$b_1 + \cdots + b_t = n\$ and \$\sq...

I'm a lizard, cut here! Write a program \$P\$ with \$n\le2\$ bytes that: outputs an integer \$x,\ 0\lt x\lt n\$ when the first \$x\$ bytes are run as a program, it outputs \$P\$ when the last \$n-x\$ bytes are run as a program, it outputs \$P\$ code-golfquine

Vim, 809 bytes mbO`b"cyl:if "<C-v><C-r>c"==">"<C-v> normal @f<C-v> elseif "<C-v><C-r>c"=="<"<C-v> normal @b<C-v> elseif "<C-v><C-r>c"=="+"<C-v> normal @i<C-v> elseif "<C-v><C-r>c"=="-"<C-v> normal @d<C-v> elseif "<C-v><C-r>c"==","<C-v> normal @p<C-v> elseif "<C-v><C-r>c"=="."<C-v> normal @o<C-v> ...

Vyxal, j, 18 17 14 12 11 bytes ₁ƛ₍₃₅kF½*ṅ⟇ Try it Online! I refuse to be beaten by Arn and Ash. I absolutely will not be beaten by either of those languages. Vyxal forever lads. Explained ₁ƛ₍₃₅kF½*∑⟇ ₁ # Push 100 to the stack ƛ # Over the range [1, 100], map: (we'll call the ...

Vim, 809 580 bytes -229 bytes because shenanigans and balderdash. qq<C-v><C-v><C-v>q<Esc>^mbO<C-r>q elsei "<C-r>q<C-r>c"=="<Esc>^"xc$<C-r>q norm <Esc>^"zc$en<C-r>q <Esc>^"yd$i`b"cyl:if "<C-v><C-r>c"==">"<C-r>z@f<C-r>x<"<C-r>z@b<C-r>x+"<C-r>z@i<C-r>x-"<C-r>z@d<C-r>x,"<C-r>z@p<C-r>x."<C-r>z@o<C-r>x["<

\$\left\{ n \atop k \right\}\$ or \$S(n, k)\$ is a way of referring to the Stirling numbers of the second kind, the number of ways to partition a set of \$n\$ items into \$k\$ non-empty subsets. For example, to partition \$\{1,2,3,4\}\$ into \$2\$ non-empty subsets, we have $$\begin{matrix} \{\{1...