|
|
A033437
|
|
Number of edges in 5-partite Turán graph of order n.
|
|
16
|
|
|
0, 0, 1, 3, 6, 10, 14, 19, 25, 32, 40, 48, 57, 67, 78, 90, 102, 115, 129, 144, 160, 176, 193, 211, 230, 250, 270, 291, 313, 336, 360, 384, 409, 435, 462, 490, 518, 547, 577, 608, 640, 672, 705, 739, 774, 810, 846, 883, 921, 960, 1000, 1040, 1081, 1123, 1166, 1210, 1254
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
Apart from the initial term this is the elliptic troublemaker sequence R_n(1,5) (also sequence R_n(4,5)) in the notation of Stange (see Table 1, p. 16). For other elliptic troublemaker sequences R_n(a,b) see the cross references below. - Peter Bala, Aug 12 2013
|
|
REFERENCES
|
R. L. Graham et al., eds., Handbook of Combinatorics, Vol. 2, p. 1234.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (x^5+x^4+x^3+x^2)/((1-x^5)*(1-x)^2).
|
|
MATHEMATICA
|
Table[Floor[2n^2/5], {n, 0, 60}]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A002620, A000212, A033436, A033438, A033439, A033440, A033441, A033442, A033443, A033444. - Reinhard Zumkeller, Nov 30 2009
Elliptic troublemaker sequences: A007590 (= R_n(2,4)), A030511 (= R_n(2,6) = R_n(4,6)), A184535 (= R_n(2,5) = R_n(3,5)).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|