22815

Appears in sequences

• a(0) = 1; a(n) = (1 + a(0)^3 + ... + a(n-1)^3)/n (not always integral!).at n=4A005166
• Centered cube numbers: n^3 + (n+1)^3.at n=22A005898
• a(n) = (d(n)-r(n))/2, where d = A026037 and r is the periodic sequence with fundamental period (1,0,0,1).at n=49A026038
• a(n) is the cototient of n^3.at n=38A053192
• Number of directed 2-multigraphs on n nodes.at n=3A053467
• Number of inequivalent ways to color edges of a cube using at most n colors.at n=3A060530
• a(n) = 15*n^2.at n=39A064761
• Numbers k such that reverse(gpf(k)) = gpf(k+1), where gpf(n) = A006530(n); a(1)=1.at n=31A071844
• Odd n such that 2*phi(n) < n, but there does not exist an even k < n with phi(k) = phi(n).at n=5A118700
• Coefficient of x^floor(n/2) in the expansion of (1+x+x^3)^n.at n=15A192440
• Row sums of the triangular array A246694.at n=44A246695
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood.at n=38A272989
• Numbers n such that n and n+1 both have 24 divisors.at n=3A274362
• Numbers k such that k and k+1 are both phi-practical numbers (A260653).at n=28A330871
• Triangle read by rows: T(n,k) is the number of non-crossing set partitions of {1..4n} into n sets of 4 with k of the sets being a contiguous set of elements.at n=23A334062
• Array read by descending antidiagonals: T(n,k) is the number of oriented colorings of the edges of a regular n-dimensional orthotope (hypercube) using k or fewer colors.at n=12A337407
• a(n) = 16*n^3 - 36*n^2 + 30*n - 9.at n=11A341043
• Numbers k such that 6*k - 1 is a prime that can be written as p*q - 2, with p and q being consecutive primes.at n=3A342565
• Numbers k such that k and k+1 are products of at least 6 primes.at n=31A346207
• Odd numbers k such that sigma(k^2) > 2*k^2 and A003415(sigma(k^2)) < k^2.at n=48A347891