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.
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.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =9a(4) =28a(5) =93a(6) =315a(7) =1091a(8) =3855a(9) =13797a(10) =49929a(11) =182361a(12) =671088a(13) =2485504a(14) =9256395a(15) =34636833a(16) =130150493a(17) =490853403a(18) =1857283155a(19) =7048151355a(20) =26817356775a(21) =102280151421a(22) =390937467284
External references
- oeis: A131203