34860

Appears in sequences

• Coefficients of a special case of Poisson-Charlier polynomials.at n=41A046716
• Numbers n such that 215*2^n-1 is prime.at n=29A050859
• Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.at n=39A094816
• Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 33 for n > 0.at n=22A101074
• Numbers k such that 4*k-1, 8*k-1, 16*k-1 and 32*k-1 are all primes.at n=23A101794
• Number of products of factorials not exceeding n!.at n=25A101976
• Refines A075197(n): number of partitions of n balls of n colors. The refinement has shape A000041(n).at n=40A130273
• a(1)=1; for n>1, a(n) = a(n-1) + n^0 if n odd, a(n) = a(n-1) + n^3 if n is even.at n=22A135332
• a(n) = 144*n^2 - 127*n + 28.at n=15A156719
• G.f. satisfies: x = A(x) - 2*A(A(x))^2 + A(A(A(x)))^3.at n=5A177396
• Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square.at n=29A194196
• Number of walks of length n on the square lattice (with steps N, E, S, W) that start at (0,0) and avoid the West quadrant {(i,j): i < -|j|}.at n=8A260153
• a(n) = 4*n*(21*n - 26).at n=21A263229
• Square array A(row,col) = Sum_{k=0..row} binomial(row,k)*A002110(col+k), read by descending antidiagonals as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ...at n=23A276586
• Transpose of square array A276586.at n=25A276587
• Partial sums of A037276.at n=40A287883
• Number of squarefree parts in the partitions of n into 10 parts.at n=41A309464
• Irregular triangle read by rows: the right-hand side of the triangle in A349813.at n=76A349814
• Expansion of e.g.f. -log(1-x)^3 * exp(x) / 6.at n=8A381022