|
Search: id:A033429
|
|
| |
|
| 0, 5, 20, 45, 80, 125, 180, 245, 320, 405, 500, 605, 720, 845, 980, 1125, 1280, 1445, 1620, 1805, 2000, 2205, 2420, 2645, 2880, 3125, 3380, 3645, 3920, 4205, 4500, 4805, 5120, 5445, 5780, 6125, 6480, 6845, 7220, 7605, 8000, 8405, 8820, 9245, 9680
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Number of edges of the complete bipartite graph of order 6n, K_n,5n - Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
Number of edges of the complete tripartite graph of order 4n, K_n,n,2n - Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
5 times the squares. [From Omar E. Pol (info(AT)polprimos.com), Dec 11 2008]
|
|
REFERENCES
|
L. Hogben, Choice and Chance by Cardpack and Chessboard. Vol. 1, Chanticleer Press, NY, 1950, p. 36.
|
|
FORMULA
|
a(n)=10*n+a(n-1)-15 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 12 2009]
|
|
EXAMPLE
|
For n=2, a(2)=10*2+0-15=5; n=3, a(3)=10*3+5-15=20; n=4, a(4)=10*4+20-15=45 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 12 2009]
|
|
MAPLE
|
seq(bell(3, j)*(j-2)^2, j = 2 .. 46) ; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 29 2007
|
|
MATHEMATICA
|
s=0; lst={s}; Do[s+=n++ +5; AppendTo[lst, s], {n, 0, 7!, 10}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 16 2008]
|
|
CROSSREFS
|
Central column of A055096.
a(n) = A000290(n)*5. [From Omar E. Pol (info(AT)polprimos.com), Dec 11 2008]
Sequence in context: A161445 A031304 A061188 this_sequence A147002 A005287 A147488
Adjacent sequences: A033426 A033427 A033428 this_sequence A033430 A033431 A033432
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Jeff Burch (jmburch(AT)osprey.smcm.edu)
|
|
EXTENSIONS
|
Better description from N. J. A. Sloane (njas(AT)research.att.com) May 15 1998
|
|
|
Search completed in 0.002 seconds
|
