|
Search: id:A080856
|
|
|
| A080856 |
|
Generalized polygonal numbers. |
|
+0
23
|
|
| 1, 5, 25, 61, 113, 181, 265, 365, 481, 613, 761, 925, 1105, 1301, 1513, 1741, 1985, 2245, 2521, 2813, 3121, 3445, 3785, 4141, 4513, 4901, 5305, 5725, 6161, 6613, 7081, 7565, 8065, 8581, 9113, 9661, 10225, 10805, 11401, 12013, 12641, 13285, 13945
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Row T(4,n) of A080853
{a(k): 0 <= k < 3} = divisors of 25. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]
|
|
LINKS
|
R. Zumkeller, Enumerations of Divisors [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]
|
|
FORMULA
|
a(n)=8n^2-4n+1 = (16n^2-8n+2)/2 G.f.: (1+2x+13x^2)/(1-x)^3
a(n)=A060820(n), n>0. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 18 2008]
a(n) = C(n,0) + 4*C(n,1) + 16*C(n,2). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]
a(n)=16*n+a(n-1)-28 (with a(1)=1) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 16 2009]
|
|
EXAMPLE
|
For n=2, a(2)=16*2+1-28=5; n=3, a(3)=16*3+5-28=25; n=4, a(4)=16*4+25-28=61 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 16 2009]
|
|
CROSSREFS
|
A005408, A000124, A016813, A086514, A000125, A058331, A002522, A161701, A161702, A161703, A000127, A161704, A161706, A161707, A161708, A161710, A161711, A161712, A161713, A161715, A006261. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]
Sequence in context: A146649 A146412 A152734 this_sequence A060820 A146404 A054994
Adjacent sequences: A080853 A080854 A080855 this_sequence A080857 A080858 A080859
|
|
KEYWORD
|
easy,nonn,new
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Feb 23 2003
|
|
|
Search completed in 0.002 seconds
|
