19965

Appears in sequences

• Number of inequivalent ways to color vertices of a regular tetrahedron using <= n colors.at n=22A006008
• Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1.at n=44A035956
• Incrementally larger terms in the continued fraction (A065645) for the twin prime constant (A005597).at n=8A065426
• Odd n such that 2*phi(n) < n, but there does not exist an even k < n with phi(k) = phi(n).at n=2A118700
• a(n) = ((n-th prime)^5-(n-th prime)^3)/8.at n=4A138436
• Third accumulation array, T, of the natural number array A000027, by antidiagonals.at n=68A185508
• Coefficient array for the third power of the monic integer Chebyshev polynomials 2*T(2*n+1,x/2)/x as a function of x^2.at n=36A219235
• a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.at n=11A242512
• a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.at n=15A242514
• Numbers k such that the product of the first k primes minus the (k+1)-th prime is prime.at n=19A249798
• Numbers divisible by prime(d) for each digit d in their base-6 representation, none of which may be zero.at n=31A256876
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A296556
• Number of nX7 0..1 arrays with every element unequal to 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=8A305181
• Number of compositions (ordered partitions) of n into at most 6 prime powers (including 1).at n=24A347776
• G.f. A(x) satisfies: 1 = Sum_{n>=0} (-x)^n * A(x)^(3*n) * A(x*A(x)^n).at n=7A352855