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!)
A015948 a(n) = smallest k >= n such that k | (2^k + n). 2

%I

%S 1,2,5,4,7,10,15,8,11,14,13,28,21,78,17,16,19,22,49,42,23,26,1577,40,

%T 33,30,29,44,31,34,39,32,65,38,37,52,115,102,41,242,43,46,51,60,47,

%U 279,395,152,57,114,53,68,85,58,63,104,59,62,61,76,69,126,5773,64,67,1090

%N a(n) = smallest k >= n such that k | (2^k + n).

%C Equally, a(n) = smallest k with 2^k mod k = k - n.

%F a(p-2) = p for p prime >= 5; a(2^k) = 2^k. - _David W. Wilson_

%Y Cf. A015910, A036236.

%K nonn

%O 0,2

%A _Robert G. Wilson v_

%E Edited by _N. J. A. Sloane_, Jan 31 2009 at the suggestion of R. J. Mathar and T. D. Noe.

%E Restricted the range of k in the definition - _R. J. Mathar_, Mar 07 2010

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 April 13 16:36 EDT 2021. Contains 342936 sequences. (Running on oeis4.)