|
| |
|
|
A033444
|
|
Number of edges in 12-partite Turan graph of order n.
|
|
11
|
|
|
|
0, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 77, 89, 102, 116, 131, 147, 164, 182, 201, 221, 242, 264, 286, 309, 333, 358, 384, 411, 439, 468, 498, 529, 561, 594, 627, 661, 696, 732, 769, 807, 846, 886, 927, 969
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
Graham et al., Handbook of Combinatorics, Vol. 2, p. 1234.
|
|
|
LINKS
|
Table of n, a(n) for n=0..46.
Wikipedia, Tur%C3%A1n graph [From Reinhard Zumkeller, Nov 30 2009]
Eric Weisstein's World of Mathematics, Tur%C3%A1n Graph [From Reinhard Zumkeller, Nov 30 2009]
Index to sequences with linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,0,0,0,0,0,1,-2,1).
|
|
|
FORMULA
|
a(n) = sum(0<=k<=n, A168185(k)*(n-k) ). [From Reinhard Zumkeller, Nov 30 2009]
G.f. -x^2*(x^10+x^9+x^8+x^7+x^6+x^5+x^4+x^3+x^2+x+1)/((x-1)^3*(x+1)*(x^2-x+1)*(x^2+1)*(x^2+x+1)*(x^4-x^2+1)). [Colin Barker, Aug 09 2012]
|
|
|
CROSSREFS
|
Cf. A002620, A000212, A033436, A033437, A033438, A033439, A033440, A033441, A033442, A033443. [From Reinhard Zumkeller, Nov 30 2009]
Sequence in context: A211024 A033443 A130490 * A061791 A105336 A130910
Adjacent sequences: A033441 A033442 A033443 * A033445 A033446 A033447
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane.
|
|
|
STATUS
|
approved
|
| |
|
|
