24868
domain: N
Appears in sequences
- Square array T(n,d) read by antidiagonals: number of structurally-different guillotine partitions of a d-dimensional box in R^d by n hyperplanes.at n=31A103209
- a(n) = (1/n) * Sum_{i=0..n-1} C(n,i)*C(n,i+1)*3^i*4^(n-i), a(0)=1.at n=5A103211
- Triangle related to guillotine partitions of a k-dimensional box by n hyperplanes.at n=41A107702
- Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=28A124658
- 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, 1), (-1, 1, -1), (0, 0, 1), (1, 0, -1)}.at n=11A148176
- Number of partitions of n having standard deviation σ > 2.at n=38A238661
- Expansion of Product_{k>=1} ((1 + x^(2*k - 1))/(1 - x^(2*k - 1)))^(k^2).at n=15A294755
- Least nonnegative integer which requires n letters to spell in Turkish excluding spaces and hyphens.at n=29A305100
- Number of rectangular plane partitions of n with strictly decreasing rows and columns.at n=46A323430
- L.g.f.: -log( Sum_{n=-oo..+oo} (-p)^n * (p*x)^(n^2) ) = Sum_{n>=1} a(n) * x^n/n, where p = sqrt(3).at n=8A337968