23485

Appears in sequences

• 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=20A001296
• Expansion of 1/((1-4x)(1-5x)(1-9x)).at n=4A018911
• Odd 10-gonal (or decagonal) numbers.at n=38A028993
• Sequence resulting from a sum of three repeated binomial(n+3,4) sequences.at n=38A093039
• Number of nX2 1..7 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=4A166800
• Number of nX2 1..7 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=4A166818
• a(0) = 1, a(1) = 2; for n>1, a(n) = a(n-1) + a(n-2) + 4.at n=18A182415
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=31A244906
• Smallest k such that (k+i)*prime(n)# - 1 is prime for i = 0, 1, 2, 3, 4 with prime(n)# = A002110(n) the n-th primorial, n>1.at n=15A277691