36848

Appears in sequences

• a(n) = 2*binomial(n,3).at n=49A007290
• a(n) = (2*n - 9)*n^2.at n=28A015243
• 5-digit terms in the continued fraction for Pi.at n=6A048960
• a(1) = 2; a(n) = 9*2^(n-2) - n - 2, n>1.at n=13A054127
• Numbers such that harmonic mean of digits is 5.at n=15A062183
• a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.at n=39A083690
• Triangular array read by rows: a(n, k) = number of ordered factorizations of a "hook-type" number with n total prime factors and k distinct prime factors. "Hook-type" means that only one prime can have multiplicity > 1.at n=32A098348
• A tabular sequence of arrays counting ordered factorizations over least prime signatures. The unordered version is described by sequence A129306.at n=48A131420
• 144*n^2 - n.at n=15A156635
• a(n) = 64*n^2 - 16.at n=23A157913
• a(n) = 576*n^2 - 2*n.at n=7A158371
• a(n) = 256*n^2 - 16.at n=11A158562
• a(n) is the number of ordered partitions of {1, 1, 1, 1, 2, 3, ..., n-3}.at n=7A172111
• Number of (w,x,y,z) with all terms in {0,...,n} and at least one of these conditions holds: w<R, x<R, y<R, z>R, where R=max{w,x,y,z}-min{w,x,y,z}.at n=13A212752
• Values x of successive minima records of k = log(x)/log(-d) where d runs through the negative values of x^3-round(sqrt(x^3))^2.at n=13A232008
• Number of partitions of 2*n into parts with multiplicity <= n.at n=20A232623
• Number of compositions of n such that the smallest part has multiplicity six.at n=13A241866
• a(n) = 2*A000447(n).at n=24A259110
• Number of n X 4 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=9A281201
• Numbers k >= 1 such that A018804(k) divided by A000203(k) is an integer.at n=21A349726