This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005900 Octahedral numbers: a(n) = n*(2*n^2 + 1)/3. (Formerly M4128) 100

%I M4128

%S 0,1,6,19,44,85,146,231,344,489,670,891,1156,1469,1834,2255,2736,3281,

%T 3894,4579,5340,6181,7106,8119,9224,10425,11726,13131,14644,16269,

%U 18010,19871,21856,23969,26214,28595,31116,33781,36594,39559,42680

%N Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.

%C Series reversion of g.f.: A(x) is Sum_{n>0} - A066357(n)(-x)^n.

%C Partial sums of centered square numbers A001844. - _Paul Barry_, Jun 26 2003

%C Also as a(n) = (1/6)*(4n^3 + 2n), n>0: structured tetragonal diamond numbers (vertex structure 5) (Cf. A000447 - structured diamonds); and structured trigonal anti-prism numbers (vertex structure 5) (Cf. A100185 - structured anti-prisms). Cf. A100145 for more on structured polyhedral numbers. - James A. Record (james.record(AT)gmail.com), Nov 07 2004

%C Schlaefli symbol for this polyhedron: {3,4}.

%C If X is an n-set and Y and Z are disjoint 2-subsets of X then a(n-4) is equal to the number of 5-subsets of X intersecting both Y and Z. - _Milan Janjic_, Aug 26 2007

%C Starting with 1 = binomial transform of [1, 5, 8, 4, 0, 0, 0, ...] where (1, 5, 8, 4) = row 3 of the Chebyshev triangle A081277. - _Gary W. Adamson_, Jul 19 2008

%C a(n) = largest coefficient of (1 + ... + x^(n-1))^4. - _R. H. Hardin_, Jul 23 2009

%C Convolution square root of (1 + 6x + 19x^3 + ...) = (1 + 3x + 5x^2 + 7x^3 + ...) = A005408(x). - _Gary W. Adamson_, Jul 27 2009

%C Starting with offset 1 = the triangular series convolved with [1, 3, 4, 4, 4, ...]. - _Gary W. Adamson_, Jul 28 2009

%C One of the 5 Platonic polyhedral (tetrahedral, cube, octahedral, dodecahedral, and icosahedral) numbers (cf. A053012). - _Daniel Forgues_, May 14 2010

%C Let b be any product of four different primes. Then the divisor lattice of b^n is of width a(n+1). - _Jean Drabbe_, Oct 13 2010

%C Arises in Bezdek's proof on contact numbers for congruent sphere packings (see preprint). - _Jonathan Vos Post_, Feb 08 2011

%C Euler transform of length 2 sequence [6, -2]. - _Michael Somos_, Mar 27 2011

%C a(n+1) is the number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = 2n. - _Clark Kimberling_, Mar 19 2012

%C a(n) is the number of semistandard Young tableaux over all partitions of 3 with maximal element <= n. - _Alois P. Heinz_, Mar 22 2012

%C Self convolution of the odd numbers. - _Reinhard Zumkeller_, Apr 04 2012

%C a(n) is the number of (w,x,y,z) with all terms in {1,...,n} and w+x=y+z; also the number of (w,x,y,z) with all terms in {0,...,n} and |w-x|<=y. - _Clark Kimberling_, Jun 02 2012

%C The sequence is the third partial sum of (0, 1, 3, 4, 4, 4, ...). - _Gary W. Adamson_, Sep 11 2015

%C Partial sum of A001844. - _Robert Price_, May 13 2016

%D H. S. M. Coxeter, Polyhedral numbers, pp. 25-35 of R. S. Cohen, J. J. Stachel and M. W. Wartofsky, eds., For Dirk Struik: Scientific, historical and political essays in honor of Dirk J. Struik, Reidel, Dordrecht, 1974.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A005900/b005900.txt">Table of n, a(n) for n = 0..1000</a>

%H X. Acloque, <a href="http://members.fortunecity.fr/polynexus/index.html">Polynexus Numbers and other mathematical wonders</a> [broken link]

%H Karoly Bezdek, <a href="http://arxiv.org/abs/1102.1198">Contact numbers for congruent sphere packings</a>, arXiv:1102.1198 [math.MG], 2011.

%H Matteo Cavaleri, Alfredo Donno, <a href="https://arxiv.org/abs/1805.09368">Some degree and distance-based invariants of wreath products of graphs</a>, arXiv:1805.08989 [math.CO], 2018.

%H Y-h. Guo, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Guo/guo4.html">Some n-Color Compositions</a>, J. Int. Seq. 15 (2012) 12.1.2, eq (5), m=2.

%H Milan Janjic, <a href="http://www.pmfbl.org/janjic/">Two Enumerative Functions</a>

%H Hyun Kwang Kim, <a href="http://dx.doi.org/10.1090/S0002-9939-02-06710-2">On Regular Polytope Numbers</a>, Proc. Amer. Math. Soc., 131 (2002), 65-75.

%H T. P. Martin, <a href="http://dx.doi.org/10.1016/0370-1573(95)00083-6">Shells of atoms</a>, Phys. Reports, 273 (1996), 199-241, eq. (11).

%H J. K. Merikoski, R. Kumar and R. A. Rajput, <a href="http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol26_pp168-176.pdf">Upper bounds for the largest eigenvalue of a bipartite graph</a>, Electronic Journal of Linear Algebra ISSN 1081-3810, A publication of the International Linear Algebra Society, Volume 26, pp. 168-176, April 2013.

%H Simon Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992.

%H Simon Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">1031 Generating Functions and Conjectures</a>, Université du Québec à Montréal, 1992.

%H B. K. Teo and N. J. A. Sloane, <a href="http://neilsloane.com/doc/magic1/magic1.pdf">Magic numbers in polygonal and polyhedral clusters</a>, Inorgan. Chem. 24 (1985), 4545-4558.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OctahedralNumber.html">Octahedral Number.</a>

%H <a href="/index/Tu#2wis">Index entries for two-way infinite sequences</a>

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

%F a(n) = 1^2 + 2^2 + ... + (n-1)^2 + n^2 + (n-1)^2 + ... + 2^2 + 1^2. - _Amarnath Murthy_, May 28 2001

%F G.f.: x * (1 + x)^2 / (1 - x)^4. a(n) = -a(-n) = (2*n^3 + n) / 3.

%F a(n) = ( ((n+1)^5-n^5) - (n^5-(n-1)^5)) )/30. - Xavier Acloque, Oct 17 2003

%F a(n) is the sum of the products pq, where p and q are both positive and odd and p + q = 2n, e.g., a(4) = 7*1 + 5*3 + 3*5 + 1*7 = 44. - _Jon Perry_, May 17 2005

%F a(n) = 4*binomial(n,3) + 4*binomial(n,2) + binomial(n,1). - _Mitch Harris_, Jul 06 2006

%F a(n) = binomial(n+2,3) + 2*binomial(n+1,3) + binomial(n,3), (this pair generalizes; see A014820, the 4-cross polytope numbers).

%F Sum_{n>=1} 1/a(n) = 3*gamma + 3*Psi((I*(1/2))*sqrt(2)) - (1/2)*(3*I)*Pi*coth((1/2)*Pi*sqrt(2)) - (1/2)*(3*I)*sqrt(2) = A175577, where I=sqrt(-1). - _Stephen Crowley_, Jul 14 2009

%F a(n) = A035597(n)/2. - _J. M. Bergot_, Jun 11 2012

%F a(n) = A000578(n) - 2*A000292(n-1) for n>0. - _J. M. Bergot_, Apr 05 2014

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4), n>3. - _Wesley Ivan Hurt_, Sep 11 2015

%F E.g.f.: (1/3)*x*(3 + 6*x + 2*x^2)*exp(x). - _Ilya Gutkovskiy_, Mar 16 2017

%F a(n) = (A002061(A002061(n+1)) - A002061(A002061(n)))/6. - _Daniel Poveda Parrilla_, Jun 10 2017

%F a(n) = 6*a(n-1)/(n-1) + a(n-2) for n > 1. - _Seiichi Manyama_, Jun 06 2018

%e G.f. = x + 6*x^2 + 19*x^3 + 44*x^4 + 85*x^5 + 146*x^6 + 231*x^7 + ...

%p al:=proc(s,n) binomial(n+s-1,s); end; be:=proc(d,n) local r; add( (-1)^r*binomial(d-1,r)*2^(d-1-r)*al(d-r,n), r=0..d-1); end; [seq(be(3,n), n=0..100)];

%p A005900:=(z+1)**2/(z-1)**4; # _Simon Plouffe_ in his 1992 dissertation

%p with(combinat): seq(fibonacci(4,2*n)/12, n=0..40); # _Zerinvary Lajos_, Apr 21 2008

%t Table[(2n^3+n)/3, {n,0,40}] (* or *) LinearRecurrence[{4,-6,4,-1}, {0,1,6,19},50] (* _Harvey P. Dale_, Oct 10 2013 *)

%t CoefficientList[Series[x (1 + x)^2/(1 - x)^4, {x, 0, 45}], x] (* _Vincenzo Librandi_, Sep 12 2015 *)

%o (PARI) {a(n) = n*(2*n^2+1)/3};

%o (PARI) concat([0],Vec(x*(1 + x)^2/(1 - x)^4 + O(x^50))) \\ _Indranil Ghosh_, Mar 16 2017

%o a005900 n = sum \$ zipWith (*) odds \$ reverse odds

%o where odds = take n a005408_list

%o a005900_list = scanl (+) 0 a001844_list

%o -- _Reinhard Zumkeller_, Jun 16 2013, Apr 04 2012

%o (Maxima) makelist(n*(2*n^2+1)/3, n, 0, 20); /* _Martin Ettl_, Jan 07 2013 */

%o (MAGMA) [n*(2*n^2+1)/3: n in [0..50]]; // _Wesley Ivan Hurt_, Sep 11 2015

%o (MAGMA) I:=[0,1,6,19]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..50]]; // _Vincenzo Librandi_, Sep 12 2015

%Y Sums of 2 consecutive terms give A001845. Cf. A001844.

%Y 1/12*t*(n^3-n)+n for t = 2, 4, 6, ... gives A004006, A006527, A006003, A005900, A004068, A000578, A004126, A000447, A004188, A004466, A004467, A007588, A062025, A063521, A063522, A063523.

%Y Cf. A022521.

%Y Cf. A081277.

%Y Row n=3 of A210391. - _Alois P. Heinz_, Mar 22 2012

%Y Cf. A005408.

%Y Cf. A053676, A053677, A053678.

%Y Cf. A002061.

%Y Cf. A000292 (tetrahedral numbers), A000578 (cubes), A006566 (dodecahedral numbers), A006564 (icosahedral numbers).

%Y Similar sequence: A014820(n-1) (m=4), A069038 (m=5), A069039 (m=6), A099193(m=7), A099195 (m=8), A099196 (m=9), A099197 (m=10).

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_

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

Last modified January 18 21:54 EST 2019. Contains 319282 sequences. (Running on oeis4.)