19243

Appears in sequences

• Integers n such that the number of digits in n! is a cube.at n=19A056851
• a(n) = a(n-1) + a(n-2) + R(a(n-3)) + R(a(n-4)) where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.at n=16A074864
• Interprimes which are of the form s*prime, s=7.at n=21A075282
• A new general triangle sequence based on the Eulerian form in three parts:m=1; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) + m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=31A157177
• A new general triangle sequence based on the Eulerian form in three parts:m=1; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) + m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=32A157177
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood.at n=30A270903
• Total number of binary digits used to write all partitions of n in binary notation.at n=22A318756
• a(0) = 1; a(n) = a(n-1)*(b(n)+1)/(b(n)-1), where b(n) = A385958(n) is the largest prime p such that a(n) is an integer.at n=41A385959