22015

Appears in sequences

• Strong pseudoprimes to base 86.at n=9A020312
• Number of ways of covering a 2n X 2n lattice by 2n^2 dominoes with exactly 4 horizontal (or vertical) dominoes.at n=4A038758
• Numbers whose base-4 representation contains exactly four 1's and four 3's.at n=0A045133
• Terms of A050530 with four prime divisors.at n=10A053340
• a(n) = 2^n - 1 + Fibonacci(n-1)*2^(n+1).at n=8A060160
• Numbers k such that phi(k)+sigma(k) is a perfect cube.at n=15A061366
• a(n) = n*(n - 1)*(n + 2)/2.at n=34A077414
• Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=27A097155
• A sequence of asymptotic density zeta(10) - 1, where zeta is the Riemann zeta function.at n=21A143036
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=6A146960
• Number of 4-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=33A187509
• G.f.: 1/(1 + x + 2*x^2 + 2*x^3 + x^4).at n=38A199744
• Number of compositions of n in which the minimal multiplicity of parts equals 5.at n=20A244168
• Odd numbers n such that the sum of the binary digits of n and n^2 both equal 12.at n=19A261593
• Decimal representation of the n-th iteration of the "Rule 157" elementary cellular automaton starting with a single ON (black) cell.at n=8A263806
• 35-gonal numbers: a(n) = n*(33*n-31)/2.at n=37A282851
• 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 601", based on the 5-celled von Neumann neighborhood.at n=17A289775
• Odd numbers k such that A064989(k) is in A340151.at n=32A340091
• First occurrence of n in A345079, or -1 if n does not occur in A345079.at n=24A345080
• Products k of 4 distinct primes (or tetraprimes) such that k has no squarefree neighbors.at n=33A364141