login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005289 Number of graphs on n nodes with 3 cliques.
(Formerly M3440)
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; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..30.

_Simon 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.

_Simon Plouffe_, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Eric Weisstein's World of Mathematics, Clique.

MAPLE

A005289:=z**2*(3*z**3+z**2+z+1)/(z**2+z+1)/(z+1)**2/(z-1)**6; [Conjectured by Simon Plouffe in his 1992 dissertation.]

CROSSREFS

Sequence in context: A162740 A074252 A074210 * A037255 A027658 A001982

Adjacent sequences:  A005286 A005287 A005288 * A005290 A005291 A005292

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 18 14:49 EDT 2013. Contains 225422 sequences.