|
Search: id:A073591
|
|
| |
|
| 3, 6, 17, 66, 327, 1958, 13701, 109602, 986411, 9864102, 108505113, 1302061346, 16926797487, 236975164806, 3554627472077, 56874039553218, 966858672404691, 17403456103284422, 330665665962404001, 6613313319248080002
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) is an upper bound on the Ramsey numbers in A003323. - D. G. Rogers (drogers(AT)turing.une.edu.au), Aug 27 2006
There is a nice derivation of the recurrence relation given in the Walker reference.
|
|
REFERENCES
|
R. C. Walker, A graph coloring theorem, Math. Gaz., 60 (1976), 54-57.
|
|
MATHEMATICA
|
f[n_] := n*(f[n - 1] - 1) + 2; f[0]=2; ff[n_]:=(1/(1+n))(1+E*Gamma[1+n, 1]-E*(n^2)*Gamma[1+n, 1]+E*n*Gamma[2+n, 1]) (Spindler)
|
|
CROSSREFS
|
Cf. A003323.
Cf. A001339.
Sequence in context: A117712 A106158 A003323 this_sequence A078318 A074370 A088339
Adjacent sequences: A073588 A073589 A073590 this_sequence A073592 A073593 A073594
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 28 2002
|
|
|
Search completed in 0.002 seconds
|
