28962

Appears in sequences

• a(n) = n*a(n-1) - n + 2 for n > 1; a(1)=1.at n=7A094294
• Expansion of 1 + Sum_{n>=1} (x^(n^2) / Product_{k>=n} (1 - x^k)).at n=39A188216
• Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=15A228964
• Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=2A235442
• Number of (n+1) X (3+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=2A235444
• T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=12A235449
• Expansion of Product_{k>=0} 1/(1-x^(5*k+4))^(5*k+4).at n=44A285132
• Expansion of Product_{k>=1} B(x^k), where B(x) is the g.f. of A003106.at n=46A327691
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/(2*k-1))^3.at n=30A350163