Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165648
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165648 Number of disconnected (simple) graphs on n vertices with each component regular. +0
3
1, 2, 4, 7, 13, 23, 41, 77, 149, 397, 1246, 21135, 430933, 51156773, 3044120326, 1704554902881 (list; graph; listen)
OFFSET

2,2

EXAMPLE

The a(2)=1 graph is: 2K_1. The a(3)=2 graphs are: 3K_1, K_1+K_2. The a(4)=4 graphs are: 4K_1, 2K_1+K_2, K_1+K_3, 2K_2.

CROSSREFS

Equals A165647 minus A005177.

Sequence in context: A114832 A136299 A003116 this_sequence A078038 A048888 A026724

Adjacent sequences: A165645 A165646 A165647 this_sequence A165649 A165650 A165651

KEYWORD

nonn

AUTHOR

Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 23 2009

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research