|
|
A130809
|
|
If X_1, ..., X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 3-subsets of X containing none of X_i, (i=1,...,n).
|
|
20
|
|
|
8, 32, 80, 160, 280, 448, 672, 960, 1320, 1760, 2288, 2912, 3640, 4480, 5440, 6528, 7752, 9120, 10640, 12320, 14168, 16192, 18400, 20800, 23400, 26208, 29232, 32480, 35960, 39680, 43648, 47872, 52360, 57120, 62160, 67488, 73112, 79040, 85280
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
Uncentered octahedral numbers: take a simple cubical grid of size n X n X n where n = 2k is an even number, n >= 6. Retain all points that are at Manhattan distance n or greater from all 8 corners of the cube, and discard all other points. The number of points that remain is a(k). If n were to be an odd number, the same operation would yield the centered octahedral numbers A001845. - Arun Giridhar, Mar 06 2014
For an (n+2)-dimensional Rubik's cube, the number of cubes that have exactly 3 exposed facets. - Phil Scovis, Aug 03 2009
a(n) is also the number of unit tetrahedra in an (n+1)-scaled octahedron composed of the tetrahedral-octahedral honeycomb. - Jason Pruski, Aug 31 2017
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (4/3)*n*(n-1)*(n-2).
Sum_{n>=3} 1/a(n) = 3/16.
Sum_{n>=3} (-1)^(n+1)/a(n) = 3*log(2)/2 - 15/16. (End)
|
|
MAPLE
|
a:=n->4/3*n*(n-1)*(n-2);
|
|
MATHEMATICA
|
Table[(4/3) n (n - 1) (n - 2), {n, 3, 41}] (* or *)
Table[Binomial[n, n - 3] 2^3, {n, 3, 41}] (* or *)
DeleteCases[#, 0] &@ CoefficientList[Series[8 x^3/(1 - x)^4, {x, 0, 41}], x] (* Michael De Vlieger, Aug 31 2017 *)
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A000079, A001787, A001788, A001789, A001845, A002409, A003472, A038207, A046092, A054849, A054851, A056220, A140325, A140354.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|