Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051930
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051930 Number of independent sets of vertices in graph K_5 X C_n (n > 2). +0
1
6, 1, 31, 136, 731, 3771, 19606, 101781, 528531, 2744416, 14250631, 73997551, 384238406, 1995189561, 10360186231, 53796120696, 279340789731, 1450500069331, 7531841136406, 39109705751341, 203080369893131 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = 4*a(n-1) + 6*a(n-2) + a(n-3)

CROSSREFS

Adjacent sequences: A051927 A051928 A051929 this_sequence A051931 A051932 A051933

Sequence in context: A120105 A120101 A030524 this_sequence A038255 A075501 A089504

KEYWORD

easy,nonn

AUTHOR

Stephen G. Penrice (spenrice(AT)ets.org), Dec 19 1999

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 20 1999

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research