23310

Appears in sequences

• A generalized partition function.at n=17A002602
• 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.at n=27A007584
• Expansion of 1/((1-9*x)*(1-10*x)*(1-11*x)*(1-12*x)).at n=3A016094
• a(n) = n*(n+1)*(n+2)/2.at n=35A027480
• Number of ways to partition n labeled elements into 4 pie slices allowing the pie to be turned over; number of 2-element proper antichains of an n-element set.at n=8A032263
• a(n) = n*(2*n-1)*(2*n+1).at n=18A035328
• Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3.at n=18A045693
• Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a four-fold rotation. Also the sequence for the corresponding four-fold rotoinversions.at n=3A053173
• Coefficients of ménage hit polynomials.at n=4A058086
• Where A007535 reaches a record.at n=40A098653
• Triangle of coefficients of q in e.g.f. that satisfies: A(x,q) = exp( q*x*A(q*x,q) ), read by rows of [n*(n-1)/2 + 1] terms in row n for n>=0.at n=49A126265
• Triangle read by rows in which row n gives number of ways to partition n labeled elements into k pie slices allowing the pie to be turned over (n >= 1, 1 <= k <= n).at n=39A133800
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10.at n=31A135195
• a(n) = n*(n^2 - 1)/2.at n=36A135503
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A151186
• a(0)=1, a(n) = (3n-1)*3n*(3n+1)/2 for n>0.at n=12A157024
• a(n) = 686*n - 14.at n=33A157363
• a(n) = 1458*n - 18.at n=15A157508
• Denominator of (n+3) / ((n+2) * (n+1) * n).at n=34A168061
• Denominators of ((n+3)/(n+2)/(n+1)/n) (sorted with no repeats).at n=34A168062