login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155886 Least k such that 2^(2^k) = n (mod k). 1

%I

%S 1,3,14,11,6,1941491,10,83,31,13,123,35,71,27,34913,241,18,8059,34,

%T 349,44,25,39,100867561,76,231,253,66203,57,227,139,45,184,37,111,97,

%U 55,41,103,1099,81,66791,53

%N Least k such that 2^(2^k) = n (mod k).

%C First occurrence of n in sequence A155836.

%Y A015910 (2^n mod n), A036236

%K nonn

%O 0,2

%A _T. D. Noe_, Jan 29 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 07:33 EDT 2021. Contains 345416 sequences. (Running on oeis4.)