login
This site is supported by donations to The OEIS Foundation.

 

Logo

110 people attended OEIS-50 (videos, suggestions); annual fundraising drive to start soon (donate); editors, please edit! (stack is over 300), your editing is more valuable than any donation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002412 Hexagonal pyramidal numbers, or greengrocer's numbers.
(Formerly M4374 N1839)
52

%I M4374 N1839

%S 0,1,7,22,50,95,161,252,372,525,715,946,1222,1547,1925,2360,2856,3417,

%T 4047,4750,5530,6391,7337,8372,9500,10725,12051,13482,15022,16675,

%U 18445,20336,22352,24497,26775,29190,31746,34447,37297,40300

%N Hexagonal pyramidal numbers, or greengrocer's numbers.

%C Binomial transform of (1, 6, 9, 4, 0, 0, 0,...). - _Gary W. Adamson_, Oct 16 2007

%C a(n) is the sum of the maximum(m,n) over {(m,n): m,n in positive integers, m<=n}. - _Geoffrey Critzer_, Oct 11 2009

%C We obtain these numbers for d=2 in the identity n*(n*(d*n-d+2)/2)-sum(k*(d*k-d+2)/2, k=0..n-1) = n*(n+1)*(2*d*n-2*d+3)/6 (see Klaus Strassburger in Formula lines). - _Bruno Berselli_, Apr 21 2010, Nov 16 2010

%C q^a(n) is the Hankel transform of the q-Catalan numbers. - _Paul Barry_, Dec 15 2010

%C Row 1 of the convolution array A213835. - _Clark Kimberling_, Jul 04 2012

%C From _Ant King_, Oct 24 2012: (Start)

%C For n>0, the digital roots of this sequence A010888(A002412(n)) form the purely periodic 27-cycle {1,7,4,5,5,8,9,3,3,4,1,7,8,8,2,3,6,6,7,4,1,2,2,5,6,9,9}.

%C For n>0, the units' digits of this sequence A010879(A002412(n)) form the purely periodic 20-cycle {1,7,2,0,5,1,2,2,5,5,6,2,7,5,0,6,7,7,0,0}.

%C (End)

%C Partial sums of A000384. - _Omar E. Pol_, Jan 12 2013

%C Row sums of A094728. - _J. M. Bergot_, Jun 14 2013

%D A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 194.

%D E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93.

%D L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 2.

%D T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.

%D I. Siap, Linear codes over F_2 + u*F_2 and their complete weight enumerators, in Codes and Designs (Ohio State, May 18, 2000), pp. 259-271. De Gruyter, 2002.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H T. D. Noe and William A. Tedeschi, <a href="/A002412/b002412.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms computed by T. D. Noe)

%H B. Berselli, A description of the transform in Comments lines: website <a href="http://www.lanostra-matematica.org/2008/12/sequenze-numeriche-e-procedimenti.html">Matem@ticamente</a> (in Italian).

%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 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HexagonalPyramidalNumber.html">Hexagonal Pyramidal Number</a>

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

%F a(n) = n(n + 1)(4n - 1)/6.

%F G.f.: x*(1+3*x)/(1-x)^4. - _Simon Plouffe_ in his 1992 dissertation.

%F a(n) = n^3 - sum(i^2, i=1..(n-1)). - Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de)

%F Partial sums of n odd triangular numbers, e.g., a(3) = t(1)+t(3)+t(5) = 1+6+15 = 22. - Jon Perry, Jul 23 2003

%F a(n) = sum{i=0..n-1} (n - i)(n + i). - Jon Perry, Sep 26 2004

%F a(n) = n*A000292(n) - (n-1)*A000292(n-1) = n*binomial((n+2),3) - (n-1)*binomial((n+1),3); e.g., a(5) = 95 = 5*35 - 4*20. - _Gary W. Adamson_, Dec 28 2007

%F a(n) = sum{i=0..n} 2i^2 + 3i + 1, for n >= 0 (Omits the leading 0). - _William A. Tedeschi_, Aug 25 2010

%F a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4), with a(0)=0, a(1)=1, a(2)=7, a(3)=22. - _Harvey P. Dale_, Jul 16 2011

%F a(n) = sum a*b, where the summing is over all unordered partitions 2*n = a+b. - _Vladimir Shevelev_, May 11 2012

%F From _Ant King_, Oct 24 2012: (Start)

%F a(n) = a(n-1) + n(2n-1).

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

%F a(n) = (n+1)*(2*A000384(n) + n)/6 = (4*n-1)*A000217(n)/3.

%F a(n) = A000292(n) + 3*A000292(n-1) = A002411(n) + A000292(n-1).

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

%F Sum_{n>=0} 1/a(n) = 6*(12*log(2)-2*Pi-1)/5 = 1.2414...

%F (End)

%F a(n) = sum(i=1..n, sum(j=1..n, max(i,j))) = sum(i<=n, i*(2n-i)). - _Enrique Pérez Herrero_, Jan 15 2013

%F a(n) = A005900(n+1) - A000326(n+1) = Octahedral - Pentagonal Numbers. - _Richard R. Forberg_, Aug 07 2013

%F a(n) = n*A000217(n) + sum( A000217(i), i=0..n-1 ). - _Bruno Berselli_, Dec 18 2013

%F a(n) = 2n * A000217(n) - A000330(n). - _J. M. Bergot_, Apr 05 2014

%e Let n=5, 2*n=10. Since 10=1+9=2+8=3+7=4+6=5+5, then a(5)=1*9+2*8+3*7+4*6+5*5=95. - _Vladimir Shevelev_, May 11 2012

%p seq(sum(i*(2*k-i), i=1..k), k=0..100); # _Wesley Ivan Hurt_, Sep 25 2013

%t Figurate[ ngon_, rank_, dim_] := Binomial[rank + dim - 2, dim - 1] ((rank - 1)*(ngon - 2) + dim)/dim; Table[ Figurate[6, r, 3], {r, 0, 40}] (* _Robert G. Wilson v_, Aug 22 2010 *)

%t Table[n(n+1)(4n-1)/6, {n,0,40}] (* or *) LinearRecurrence[{4,-6,4,-1}, {0,1,7,22}, 40] (* _Harvey P. Dale_, Jul 16 2011 *)

%o (PARI) v=vector(40,i,t(i)); s=0; forstep(i=1,40,2,s+=v[i]; print1(s","))

%o (Maxima) A002412(n):=n*(n+1)*(4*n-1)/6$ makelist(A002412(n),n,0,20); /* _Martin Ettl_, Dec 12 2012 */

%Y Bisection of A002623. Equals A000578(n) - A000330(n-1).

%Y Cf. A000292, A016061.

%Y a(n) = A093561(n+2, 3), (4, 1)-Pascal column.

%Y Cf. A220084 for a list of numbers of the form n*P(k,n)-(n-1)*P(k,n-1), where P(k,n) is the n-th k-gonal pyramidal number (see Adamson's formula).

%Y Cf. similar sequences listed in A237616.

%K nonn,easy,nice

%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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified October 31 08:17 EDT 2014. Contains 248847 sequences.