|
| |
| |
|
|
|
0, 28, 112, 252, 448, 700, 1008, 1372, 1792, 2268, 2800, 3388, 4032, 4732, 5488, 6300, 7168, 8092, 9072, 10108, 11200, 12348, 13552, 14812, 16128, 17500, 18928, 20412, 21952, 23548, 25200, 26908, 28672, 30492, 32368, 34300, 36288, 38332
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Number of edges in a complete 8-partite graph of order 8n, K_n,n,n,n,n,n,n,n
|
|
|
FORMULA
| a(n)=56*n+a(n-1)-28 (with a(0)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 07 2010]
|
|
|
EXAMPLE
| a(1)=56*1+0-28=28; a(2)=56*2+28-28=112; a(3)=56*3+112-28=252 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 07 2010]
|
|
|
CROSSREFS
| A033583, A033581, A000290, A000217, A033428.
Sequence in context: A044660 A183341 A118613 * A042534 A042536 A042538
Adjacent sequences: A064760 A064761 A064762 * A064764 A064765 A064766
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Oct 18 2001
|
| |
|
|
