22596
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n-2) + (n+2)*binomial(n+3, 3)/2, with a(0) = 1, a(1) = 7.at n=11A054469
- Least k such that the distance from k^2 to closest prime = n or zero if no k exists.at n=54A079666
- G.f.: Product_{m>=1} 1/(1-x^m)^A018819(m).at n=18A089292
- a(n) = 3*trinomial(n+1,0) - trinomial(n+2,0).at n=12A103872
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, 1), (1, 1, -1)}.at n=11A148281
- Number of partitions p of n such that mean(p) >= multiplicity(min(p)).at n=41A240079
- Number of partitions p of n such that mean(p) > multiplicity(min(p)).at n=41A240206
- Number of nX3 0..1 arrays with every element unequal to 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=10A305218
- E.g.f. satisfies log(A(x)) = x * (exp(x*A(x)) - 1) * A(x)^3.at n=6A356789