id:A051929 - OEIS Search Results

Search: id:A051929

Displaying 1-1 of 1 results found.

page 1

A051929

Number of independent sets of vertices in graph K_4 X C_n (n > 2).

+0
1

5, 1, 21, 73, 325, 1361, 5781, 24473, 103685, 439201, 1860501, 7881193, 33385285, 141422321, 599074581, 2537720633, 10749957125, 45537549121, 192900153621, 817138163593, 3461452808005, 14662949395601, 62113250390421 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(n) = 3a(n-1) + 5a(n-2) + a(n-3)`
	CROSSREFS	`Sequence in context: A095368 A029757 A101625 this_sequence A123967 A077195 A038243` `Adjacent sequences: A051926 A051927 A051928 this_sequence A051930 A051931 A051932`
	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

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research