login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131203 Number of cycles of length n under the mapping x -> x^2-2 modulo Fermat prime 2^(2^m)+1, where m is any fixed integer such that n divides 2^m-1. 0

%I #5 May 23 2016 00:51:50

%S 1,1,3,9,28,93,315,1091,3855,13797,49929,182361,671088,2485504,

%T 9256395,34636833,130150493,490853403,1857283155,7048151355,

%U 26817356775,102280151421,390937467284,1497207322929,5744387279808,22076468760335

%N Number of cycles of length n under the mapping x -> x^2-2 modulo Fermat prime 2^(2^m)+1, where m is any fixed integer such that n divides 2^m-1.

%C Halved bisection of A001037.

%F a(n) = A001037(2n+1)/2.

%Y Cf. A001037, A059966.

%K nonn

%O 0,3

%A _Max Alekseyev_, Sep 27 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:49 EDT 2024. Contains 371967 sequences. (Running on oeis4.)