|
Search: id:A005289
|
|
|
| A005289 |
|
Number of graphs on n nodes with 3 cliques.
(Formerly M3440)
|
|
+0
1
|
|
| 0, 0, 1, 4, 12, 31, 67, 132, 239, 407, 657, 1019, 1523, 2211, 3126, 4323, 5859, 7806, 10236, 13239, 16906, 21346, 26670, 33010, 40498, 49290, 59543, 71438, 85158, 100913
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
R. K. Guy, personal communication.
R. K. Guy, Monthly research problems, 1969-73, Amer. Math. Monthly, 80 (1973), 1120-1128.
R. K. Guy, Monthly research problems, 1969-75, Amer. Math. Monthly, 82 (1975), 995-1004.
Reid, K. B. The number of graphs on N vertices with 3 cliques. J. London Math. Soc. (2) 8 (1974), 94-98.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
MAPLE
|
A005289:=z**2*(3*z**3+z**2+z+1)/(z**2+z+1)/(z+1)**2/(z-1)**6; [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
CROSSREFS
|
Sequence in context: A068055 A074252 A074210 this_sequence A037255 A027658 A001982
Adjacent sequences: A005286 A005287 A005288 this_sequence A005290 A005291 A005292
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
