101354

Appears in sequences

• Number of steps to compute n-th prime in PRIMEGAME (slow version).at n=12A007547
• a(n) = the multiple of n which is > (sum{k=1 to n-1} a(k)) and is <= (n + sum{k=1 to n-1} a(k)).at n=16A128020
• Triangle T(n, k) = binomial(n, k) + binomial(k*(n-k), n) + 2*(-1)^n*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows.at n=24A155826