login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 19

%I #78 Mar 24 2022 08:04:43

%S 8,32,80,160,280,448,672,960,1320,1760,2288,2912,3640,4480,5440,6528,

%T 7752,9120,10640,12320,14168,16192,18400,20800,23400,26208,29232,

%U 32480,35960,39680,43648,47872,52360,57120,62160,67488,73112,79040,85280

%N 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).

%C 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

%C For an (n+2)-dimensional Rubik's cube, the number of cubes that have exactly 3 exposed facets. - _Phil Scovis_, Aug 03 2009

%C a(n) is the number of 2-simplices in an n-cross polytope. - _Arkadiusz Wesolowski_, Oct 16 2012

%C 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

%H Vincenzo Librandi, <a href="/A130809/b130809.txt">Table of n, a(n) for n = 3..1000</a>

%H Harlan J. Brothers, <a href="http://www.brotherstechnology.com/math/pascals-prism.html">Pascal's Prism: Supplementary Material</a>, 2012.

%H Milan Janjic, <a href="https://pmf.unibl.org/wp-content/uploads/2017/10/enumfor.pdf">Two Enumerative Functions</a>

%H Luis Manuel Rivera, <a href="http://arxiv.org/abs/1406.3081">Integer sequences and k-commuting permutations</a>, arXiv preprint arXiv:1406.3081 [math.CO], 2014.

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1)

%F a(n) = (4/3)*n*(n-1)*(n-2).

%F a(n) = C(n,n-3)*8, n >= 3. - _Zerinvary Lajos_, Dec 07 2007

%F G.f.: 8*x^3/(1-x)^4. - _Colin Barker_, Apr 14 2012

%F For n>1, a(n) = a(n-1) + A056220(n-1) + A056220(n-2). - _Bruce J. Nicholson_, Feb 14 2018

%F From _Amiram Eldar_, Mar 24 2022: (Start)

%F Sum_{n>=3} 1/a(n) = 3/16.

%F Sum_{n>=3} (-1)^(n+1)/a(n) = 3*log(2)/2 - 15/16. (End)

%p a:=n->4/3*n*(n-1)*(n-2);

%t Table[(4/3) n (n - 1) (n - 2), {n, 3, 41}] (* or *)

%t Table[Binomial[n, n - 3] 2^3, {n, 3, 41}] (* or *)

%t DeleteCases[#, 0] &@ CoefficientList[Series[8 x^3/(1 - x)^4, {x, 0, 41}], x] (* _Michael De Vlieger_, Aug 31 2017 *)

%o (Magma) [(4/3)*n*(n-1)*(n-2): n in [3..60]]; // _Vincenzo Librandi_, Oct 03 2017

%o (PARI) a(n) = 4*n*(n-1)*(n-2)/3; \\ _Andrew Howroyd_, Nov 06 2018

%Y Cf. A000079, A001787, A001788, A001789, A002409, A003472, A038207, A046092, A054849, A054851, A056220, A140325, A140354.

%K nonn,easy

%O 3,1

%A _Milan Janjic_, Jul 16 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)