Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051928
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051928 Number of independent sets of vertices in graph K_3 X C_n (n > 2). +0
1
4, 1, 13, 34, 121, 391, 1300, 4285, 14161, 46762, 154453, 510115, 1684804, 5564521, 18378373, 60699634, 200477281, 662131471, 2186871700, 7222746565, 23855111401, 78788080762 (list; graph; listen)
OFFSET

0,1

FORMULA

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

CROSSREFS

Sequence in context: A055252 A116414 A115154 this_sequence A050156 A096644 A016115

Adjacent sequences: A051925 A051926 A051927 this_sequence A051929 A051930 A051931

KEYWORD

easy,nonn

AUTHOR

Stephen G. Penrice (spenrice(AT)ets.org), Dec 19 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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research