22572

Appears in sequences

• Expansion of (2/(1+sqrt(1-36*x)))^(1/3).at n=4A008931
• Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=38A035987
• Multiples of 6 with only prime digits (2, 3, 5 and 7).at n=30A077535
• Triangle read by rows: T(n,k) = Sum_{j>=0} j!*T(n-j-1, k-1) for n >= 0, k >= 0.at n=58A084938
• Eighth diagonal (m=7) of triangle A084938; a(n) = A084938(n+7,n) = (n^7 + 63*n^6 + 1855*n^5 + 34125*n^4 + 438424*n^3 + 3980172*n^2 + 20946960*n)/5040.at n=3A090393
• Fourth column (k=3) of triangle A084938.at n=7A090595
• Number of subsets of the n-th roots of 1 with absolute value of sum = 1.at n=22A108417
• Number of rooted trees with total weight n, where the weight of a node at height k is k (with the root considered to be at level 1).at n=53A117357
• G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^Fibonacci(n).at n=11A177377
• Number of collinear point 7-tuples in an n X n cubical grid.at n=11A178259
• Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=18A180826
• Molecular topological indices of the Apollonian graphs.at n=3A192792
• A213784/12.at n=36A213789
• Number of length n+3 0..3 arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=4A249285
• T(n,k) = Number of length n+3 0..k arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=25A249290
• Number of length 5+3 0..n arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=2A249295
• Total number of nodes summed over all lattice paths from (0,0) to (n,0) that do not go below the x-axis or above the diagonal x=y and consist of steps U=(1,1), D=(1,-1) and S=(0,1).at n=9A286427
• Number of involutions of [n] having exactly one peak.at n=22A303649
• a(n) = 4*(n - 1)*(16*n - 23) for n >= 1.at n=19A304378
• Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of vertices formed.at n=21A371373