|
Search: id:A033440
|
|
|
| A033440 |
|
Number of edges in 8-partite Turan graph of order n. |
|
+0
1
|
|
| 0, 0, 1, 3, 6, 10, 15, 21, 28, 35, 43, 52, 62, 73, 85, 98, 112, 126, 141, 157, 174, 192, 211, 231, 252, 273, 295, 318, 342, 367, 393, 420, 448, 476, 505, 535, 566, 598, 631, 665, 700, 735, 771, 808, 846, 885, 925
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
Graham et al., Handbook of Combinatorics, Vol. 2, p. 1234.
|
|
FORMULA
|
a(n)=round( (7/16)*n(n-2) ) +0 or -1 depending on n: if there is k such 8k+4<=n<=8k+6 then a(n) = floor( (7/16)*n*(n-2)) otherwise a(n) = round( (7/16)*n(n-2)). E.g. because 8*2+4<=21<=8*2+6 a(n)=floor((7/16)*21*19)=floor(174, 5625)=174. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 17 2002
|
|
CROSSREFS
|
Sequence in context: A124158 A109444 A124157 this_sequence A067525 A130487 A108923
Adjacent sequences: A033437 A033438 A033439 this_sequence A033441 A033442 A033443
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
