50112

Appears in sequences

• Number of primes with nonzero digits and digit sum n.at n=19A073901
• Expansion of 2*x/(1-6*x-120*x^2+300*x^3).at n=5A122767
• G.f. satisfies: A(x) = x + A((x+x^2)*A(x)) with A(0)=0.at n=12A154835
• a(n) = 49*n^2 - 2*n.at n=31A157362
• Number of nondecreasing strings of numbers x(i=1..n) in -4..4 with sum x(i)^3 equal to 0.at n=28A188272
• T(n,k) = Number of n-step self-avoiding walks on a k X k X k X k 4-cube summed over all starting positions.at n=30A188784
• Number of 3-step self-avoiding walks on an n X n X n X n 4-cube summed over all starting positions.at n=5A188786
• Numbers with prime factorization pq^3r^6.at n=10A190467
• Number of defective 3-colorings of an n X n 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=3A229503
• Number of defective 3-colorings of an n X 4 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=3A229506
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=24A229510
• Coefficients in q-expansion of (E_4 + E_2^2)/2, where E_2 and E_4 are the Eisenstein series shown in A006352 and A004009, respectively.at n=6A282017
• Irregular table read by rows: T(n,k) is the number of 2n-step closed self-avoiding paths on a 2D square lattice with area k, where k >= n-1.at n=35A334756
• Numbers that are the sum of four third powers in eight or more ways.at n=27A345152
• Numbers that are the sum of four third powers in exactly eight ways.at n=20A345153
• Numbers k for which sigma(k) >= 2*k and (sigma(k) - 2*k) AND k = k, where AND is bitwise-and, A004198.at n=33A388026