login
Search: a172076 -id:a172076
     Sort: relevance | references | number | modified | created      Format: long | short | data
a(n) = n*(n + 1)*(5*n - 4)/2.
+10
28
0, 1, 18, 66, 160, 315, 546, 868, 1296, 1845, 2530, 3366, 4368, 5551, 6930, 8520, 10336, 12393, 14706, 17290, 20160, 23331, 26818, 30636, 34800, 39325, 44226, 49518, 55216, 61335, 67890, 74896, 82368, 90321, 98770, 107730, 117216, 127243, 137826, 148980, 160720
OFFSET
0,3
COMMENTS
Also 17-gonal (or heptadecagonal) pyramidal numbers.
This sequence is related to A226489 by 2*a(n) = n*A226489(n) - Sum_{i=0..n-1} A226489(i).
REFERENCES
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93 (fifteenth row of the table).
FORMULA
G.f.: x*(1 + 14*x) / (1 - x)^4.
For n>0, a(n) = Sum_{i=0..n-1} (n-i)*(15*i+1). More generally, the sequence with the closed form n*(n+1)*(k*n-k+3)/6 is also given by Sum_{i=0..n-1} (n-i)*(k*i+1) for n>0.
a(n) = A104728(A001844(n-1)) for n>0.
Sum_{n>=1} 1/a(n) = (2*sqrt(5*(5 + 2*sqrt(5)))*Pi + 10*sqrt(5)*arccoth(sqrt(5)) + 25*log(5) - 16)/72 = 1.086617842136293176... . - Vaclav Kotesovec, Dec 07 2016
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n >= 4. - Wesley Ivan Hurt, Dec 18 2020
EXAMPLE
After 0, the sequence is provided by the row sums of the triangle:
1;
2, 16;
3, 32, 31;
4, 48, 62, 46;
5, 64, 93, 92, 61;
6, 80, 124, 138, 122, 76;
7, 96, 155, 184, 183, 152, 91;
8, 112, 186, 230, 244, 228, 182, 106;
9, 128, 217, 276, 305, 304, 273, 212, 121;
10, 144, 248, 322, 366, 380, 364, 318, 242, 136; etc.,
where (r = row index, c = column index):
T(r,r) = T(c,c) = 15*r-14 and T(r,c) = T(r-1,c)+T(r,r) = (r-c+1)*T(r,r), with r>=c>0.
MAPLE
seq(n*(n+1)*(5*n-4)/2, n=0..40); # G. C. Greubel, Aug 30 2019
MATHEMATICA
Table[n(n+1)(5n-4)/2, {n, 0, 40}]
CoefficientList[Series[x (1+14x)/(1-x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Feb 12 2014 *)
LinearRecurrence[{4, -6, 4, -1}, {0, 1, 18, 66}, 50] (* Harvey P. Dale, Jan 11 2015 *)
PROG
(Magma) [n*(n+1)*(5*n-4)/2: n in [0..40]];
(Magma) I:=[0, 1, 18, 66]; [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, Feb 12 2014
(PARI) a(n)=n*(n+1)*(5*n-4)/2 \\ Charles R Greathouse IV, Sep 24 2015
(Sage) [n*(n+1)*(5*n-4)/2 for n in (0..40)] # G. C. Greubel, Aug 30 2019
(GAP) List([0..40], n-> n*(n+1)*(5*n-4)/2); # G. C. Greubel, Aug 30 2019
CROSSREFS
Cf. sequences with formula n*(n+1)*(k*n-k+3)/6: A000217 (k=0), A000292 (k=1), A000330 (k=2), A002411 (k=3), A002412 (k=4), A002413 (k=5), A002414 (k=6), A007584 (k=7), A007585 (k=8), A007586 (k=9), A007587 (k=10), A050441 (k=11), A172073 (k=12), A177890 (k=13), A172076 (k=14), this sequence (k=15), A172078(k=16), A237617 (k=17), A172082 (k=18), A237618 (k=19), A172117(k=20), A256718 (k=21), A256716 (k=22), A256645 (k=23), A256646(k=24), A256647 (k=25), A256648 (k=26), A256649 (k=27), A256650(k=28).
KEYWORD
nonn,easy
AUTHOR
Bruno Berselli, Feb 10 2014
STATUS
approved
a(n) = n*(n + 1)*(n + 2)*(7*n - 5)/12.
+10
3
0, 1, 18, 80, 230, 525, 1036, 1848, 3060, 4785, 7150, 10296, 14378, 19565, 26040, 34000, 43656, 55233, 68970, 85120, 103950, 125741, 150788, 179400, 211900, 248625, 289926, 336168, 387730, 445005, 508400, 578336, 655248, 739585, 831810, 932400, 1041846
OFFSET
0,3
COMMENTS
Partial sums of 16-gonal (or hexadecagonal) pyramidal numbers. Therefore, this is the case k=7 of the general formula n*(n + 1)*(n + 2)*(k*n - k + 2)/12, which is related to 2*(k+1)-gonal pyramidal numbers.
FORMULA
G.f.: x*(1 + 13*x)/(1 - x)^5.
a(n) = Sum_{k = 0..n} A172076(k).
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5). - Vincenzo Librandi, Nov 27 2015
MATHEMATICA
Table[n (n + 1) (n + 2) (7 n - 5)/12, {n, 0, 50}]
LinearRecurrence[{5, -10, 10, -5, 1}, {0, 1, 18, 80, 230}, 40] (* Harvey P. Dale, Sep 27 2018 *)
PROG
(Magma) [n*(n+1)*(n+2)*(7*n-5)/12: n in [0..50]]; // Vincenzo Librandi, Nov 27 2015
(PARI) a(n)=n*(n+1)*(n+2)*(7*n-5)/12 \\ Charles R Greathouse IV, Jul 26 2016
CROSSREFS
Cf. A172076.
Cf. similar sequences with formula n*(n+1)*(n+2)*(k*n-k+2)/12: A000292 (k=0), A002415 (which arises from k=1), A002417 (k=2), A002419 (k=3), A051797 (k=4), A051799 (k=5), A220212 (k=6), this sequence (k=7), A264851 (k=8), A264852 (k=9).
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Nov 26 2015
STATUS
approved
a(n) = n*(n+1)*(7*n^2 - n - 4)/4.
+10
1
0, 1, 33, 168, 520, 1245, 2541, 4648, 7848, 12465, 18865, 27456, 38688, 53053, 71085, 93360, 120496, 153153, 192033, 237880, 291480, 353661, 425293, 507288, 600600, 706225, 825201, 958608, 1107568, 1273245, 1456845, 1659616, 1882848, 2127873
OFFSET
0,3
COMMENTS
The sequence is related to A172076 by a(n) = n*A172076(n) - Sum_{i=0..n-1} A172076(i).
This is the case d=7 in the identity n^2*(n+1)*(2*d*n-2*d+3)/6 - Sum_{k=0..n-1} k*(k+1)*(2*d*k-2*d+3)/6 = n*(n+1)*(3*d*n^2 - d*n + 4*n - 2*d + 2)/12. - Bruno Berselli, Apr 21 2010
LINKS
B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
FORMULA
G.f.: x*(1 + 28*x + 13*x^2)/(1-x)^5. - R. J. Mathar, Nov 17 2011
E.g.f.: x*(4 + 62*x + 48*x^2 + 7*x^3)*exp(x)/4. - G. C. Greubel, Aug 30 2019
MAPLE
seq(n*(n+1)*(7*n^2-n-4)/4, n=0..40); # G. C. Greubel, Aug 30 2019
MATHEMATICA
CoefficientList[Series[x(1 +28x +13x^2)/(1-x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Jan 01 2014 *)
Table[n*(n+1)*(7*n^2-n-4)/4, {n, 0, 40}] (* G. C. Greubel, Aug 30 2019 *)
PROG
(Magma) [n*(n+1)*(7*n^2-n-4)/4: n in [0..40]]; // Vincenzo Librandi, Jan 01 2014
(PARI) vector(40, n, n*(n-1)*(7*(n-1)^2-(n-1)-4)/4) \\ G. C. Greubel, Aug 30 2019
(Sage) [n*(n+1)*(7*n^2-n-4)/4 for n in (0..40)] # G. C. Greubel, Aug 30 2019
(GAP) List([0..40], n-> n*(n+1)*(7*n^2-n-4)/4); # G. C. Greubel, Aug 30 2019
CROSSREFS
Cf. A172076.
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jan 25 2010
STATUS
approved

Search completed in 0.005 seconds