28460
domain: N
Appears in sequences
- Maximal coefficient of Product_{k<=n} (1 + x^k). Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or 1.at n=21A025591
- Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=35A038854
- Largest coefficient in expansion of Product_{i=1..n} (1 + (-q)^i).at n=20A039828
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 1.at n=21A063866
- Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.at n=20A069918
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 5,0,2,1,0,1,2 for x=0,1,2,3,4,5,6.at n=5A203114
- G.f. satisfies: A(x) = x^2 + x^3 + A(A(x)).at n=14A213905
- Number of partitions p of n such that median(p) <= multiplicity(min(p)).at n=41A240213
- a(n) = prime(n)^3 - n^3.at n=10A262186