18101

Appears in sequences

• a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=40A014813
• a(n) = Sum_{k=0..floor(n/2)} C(n-k,k+2)*2^(n-k-2)*(1/2)^k.at n=10A099625
• Minimal peaks in digital expansions of Pi: positions of peaks equal to 1.at n=17A105275
• Triangle T(n,k) read by rows: Sum_{k=0..binomial(n,2)} T(n,k)*q^k = n!*Sum_{pi} faq(n,q)/Product_{i=1..n} e(i)!*faq(i,q)^e(i), where pi runs over all nonnegative integer solutions to e(1) + 2*e(2) + ... + n*e(n) = n and faq(i,q) = Product_{j=1..i} (q^j-1)/(q-1), i = 1..n.at n=33A152474
• Number of permutations of 1..n containing the relative rank sequence { 216534 } at any spacing.at n=3A159143
• L.g.f.: Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^n)^d.at n=19A205483
• Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A299817
• Number of n X 5 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299818
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=31A299821
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=32A299821
• MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed).at n=32A326260
• Number of non-biquanimous subsets of {1..n}. Sets with no subset having the same sum as the complement.at n=15A371792