id:A131203 - OEIS Search Results

Search: id:A131203

Displaying 1-1 of 1 results found.

page 1

Number of cycles of length n under the mapping x -> x^2-2 modulo Fermat prime 2^(2^m)+1 where n divides 2^m-1.

+0
1

1, 1, 3, 9, 28, 93, 315, 1091, 3855, 13797, 49929, 182361, 671088, 2485504, 9256395, 34636833, 130150493, 490853403, 1857283155, 7048151355, 26817356775, 102280151421, 390937467284, 1497207322929, 5744387279808, 22076468760335 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Halved bisection of A001037.`
	FORMULA	`a(n) = A001037(2n+1)/2.`
	CROSSREFS	`Cf. A001037, A059966.` `Sequence in context: A071752 A071756 A105849 this_sequence A081914 A120985 A014323` `Adjacent sequences: A131200 A131201 A131202 this_sequence A131204 A131205 A131206`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxal(AT)cs.ucsd.edu), Sep 27 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research