19482
domain: N
Appears in sequences
- a(n) is the number of partitions of 5n that can be obtained by adding together five (not necessarily distinct) partitions of n.at n=8A002222
- McKay-Thompson series of class 39C for Monster.at n=50A058661
- Determinant of M(n), the n X n matrix defined by m(i,i) = 1, m(i,j) = i-j.at n=22A079034
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.at n=50A094362
- The number of n-almost primes less than or equal to 4^n, starting with a(0)=1.at n=12A116426
- Number of partitions of n containing a clique of size 3.at n=39A183560
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210756; see the Formula section.at n=48A210755
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of distinct parts of p.at n=41A241818
- Expansion of Sum_{i>=1} mu(i)^2*x^i / (1 - Sum_{j>=1} mu(j)^2*x^j)^2, where mu() is the Moebius function (A008683).at n=12A281812
- Expansion of g.f. Product_{k>=2} 1/(1-x^phi(k)).at n=22A347428
- Expansion of g.f. Product_{k>=2} 1/(1-x^phi(k)).at n=23A347428
- a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(j*k) / phi(k).at n=36A372636