20992

Appears in sequences

• Numbers k such that k^2 contains only digits {0,4,6}, not ending with zero.at n=2A058437
• Expansion of (eta(q^4) / eta(q))^8 in powers of q.at n=7A092877
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 6 and 9.at n=20A136905
• Expansion of g.f. x/(1 + 4*x - 8*x^2).at n=7A174443
• Numbers of the form p^9*q where p and q are distinct primes.at n=11A179692
• a(n) = 4*a(n-1) + 8*a(n-2), with a(1)=0 and a(2)=1.at n=7A180222
• G.f.: Product_{k>=1} 1/(1-x^k)^(8*k).at n=6A193427
• Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 8.at n=31A195092
• Rolling cube footprints: number of n X n 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or vertical neighbor moves across a corresponding cube edge.at n=2A223196
• Rolling cube footprints: number of n X 3 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or vertical neighbor moves across a corresponding cube edge.at n=2A223197
• T(n,k)=Rolling cube face footprints: number of nXk 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal or vertical neighbor moves across a corresponding cube edge.at n=12A223202
• Rolling cube footprints: number of n X n 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across a corresponding cube edge.at n=2A223264
• T(n,k)=Rolling cube face footprints: number of nXk 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across a corresponding cube edge.at n=12A223269
• Rolling cube footprints: number of 3 X n 0..5 arrays starting with 0 where 0..5 label faces of a cube and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across a corresponding cube edge.at n=2A223271
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 334", based on the 5-celled von Neumann neighborhood.at n=42A271283
• a(0) = 0, a(n) = Sum_{0<d|n, n/d odd} d^4 for n > 0.at n=12A285989
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=14A288067
• Number of integer partitions of n whose omega-sequence has repeated parts.at n=37A325285
• 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=22A334756
• Positions of zeros in A345055, which is the Dirichlet inverse of A011772.at n=43A345053