id:A024168 - OEIS Search Results

Search: id:A024168

Displaying 1-1 of 1 results found.

page 1

n!(1/2 - 1/3 + .. + c/n), where c = (-1)^n.

+0
2

0, 1, 1, 10, 26, 276, 1212, 14736, 92304, 1285920, 10516320, 166112640, 1680462720, 29753498880, 359124192000, 7053661440000, 98989454592000, 2137497610752000, 34210080898560000, 805846718380032000, 14489879077804032000 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) is the number of permutations of n letters all cycles of which have length <= n/2, a quantity which arises in the solution to the One Hundred Prisoners problem. - Jim Ferry (jferry(AT)alum.mit.edu), Mar 29 2007`
	LINKS	`Index entries for sequences related to factorial numbers` `Wikipedia, One hundred prisoners.`
	FORMULA	`E.g.f.: (x-log(1+x))/(1-x). a(n)=a(n-1)+a(n-2)*(n-1)^2, n>2.`
	CROSSREFS	`A075829(n)=a(n-1)/gcd(a(n-1), a(n))` `Sequence in context: A005970 A051966 A092774 this_sequence A043107 A039284 A045177` `Adjacent sequences: A024165 A024166 A024167 this_sequence A024169 A024170 A024171`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`
	EXTENSIONS	`Formulae and more terms from Michael Somos, Oct 29, 2002`

page 1

Search completed in 0.005 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research