Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035080
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035080 Number of asymmetric connected graphs where every block is a complete graph. +0
3
1, 1, 0, 0, 0, 0, 1, 3, 7, 21, 60, 168, 472, 1344, 3843, 11104, 32305, 94734, 279708, 831401, 2485877, 7474667, 22589771, 68594611, 209198103, 640591332, 1968920180, 6072766832, 18791062733, 58321579888 (list; graph; listen)
OFFSET

0,8

FORMULA

G.f.: A(x)=B(x)+C(x)-B(x)*C(x). B, C gfs of A007561 and A035079.

CROSSREFS

Cf. A007561, A035081.

Sequence in context: A104779 A091650 A096240 this_sequence A091486 A056779 A102877

Adjacent sequences: A035077 A035078 A035079 this_sequence A035081 A035082 A035083

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Nov 15 1998.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research