id:A006183 - OEIS Search Results

Search: id:A006183

Displaying 1-1 of 1 results found.

page 1

a(n) = (n+1)*a(n-1) + (2-n)*a(n-2).
(Formerly M1663)

+0
4

2, 6, 22, 98, 522, 3262, 23486, 191802, 1753618, 17755382, 197282022, 2387112466, 31249472282, 440096734638, 6635304614542, 106638824162282, 1819969265702946, 32873194861759462, 626524419718239158 (list; graph; listen)

	OFFSET	`2,1`
	REFERENCES	`F. C. Holroyd and W. J. G. Wingate, Cycles in the complement of a tree or other graph, Discrete Math., 55 (1985), 267-282.`
	CROSSREFS	`Equals A030297(n-1) - A030297(n-2) + 1. Cf. A054096.` `Equals 2 * A001339(n+2).` `Sequence in context: A006871 A130907 A054096 this_sequence A012269 A012272 A009789` `Adjacent sequences: A006180 A006181 A006182 this_sequence A006184 A006185 A006186`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Simon Plouffe (plouffe(AT)math.uqam.ca)`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 21 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research