|
| |
| |
|
|
|
0, 7, 28, 63, 112, 175, 252, 343, 448, 567, 700, 847, 1008, 1183, 1372, 1575, 1792, 2023, 2268, 2527, 2800, 3087, 3388, 3703, 4032, 4375, 4732, 5103, 5488, 5887, 6300, 6727, 7168, 7623, 8092, 8575, 9072
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Number of edges of the complete bipartite graph of order 8n, K_n,7n - Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
Number of edges of the complete tripartite graph of order 5n, K_n,n,3n - Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
7 times the squares. [From Omar E. Pol (info(AT)polprimos.com), Dec 11 2008]
|
|
|
FORMULA
| Central terms of the triangle in A132111: a(n)=A132111(2*n,n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 10 2007
a(n) = A000290(n)*7. [From Omar E. Pol (info(AT)polprimos.com), Dec 11 2008]
a(n)=14*n+a(n-1)-7 (with a(0)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 05 2010]
|
|
|
EXAMPLE
| a(1)=14*1+0-7=7; a(2)=14*2+7-7=28; a(3)=14*3+28-7=63 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 05 2010]
|
|
|
MATHEMATICA
| s=0; lst={s}; Do[s+=n++ +7; AppendTo[lst, s], {n, 0, 8!, 14}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 16 2008]
|
|
|
CROSSREFS
| Cf. A000290. [From Omar E. Pol (info(AT)polprimos.com), Dec 11 2008]
Sequence in context: A078307 A045551 A024844 * A176362 A008457 A138503
Adjacent sequences: A033579 A033580 A033581 * A033583 A033584 A033585
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
