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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A336916 One more than the number of iterations of x -> 2x needed before the result is nondeficient, when starting from x=n; a(n) = 0, when n is a power of 2. 2

%I

%S 0,0,2,0,3,1,3,0,2,2,4,1,4,2,2,0,5,1,5,1,2,3,5,1,3,3,2,1,5,1,5,0,2,4,

%T 2,1,6,4,2,1,6,1,6,2,2,4,6,1,3,2,2,2,6,1,3,1,2,4,6,1,6,4,2,0,3,1,7,3,

%U 2,1,7,1,7,5,2,3,3,1,7,1,2,5,7,1,3,5,2,1,7,1,3,3,2,5,3,1,7,2,2,1,7,1,7,1,2

%N One more than the number of iterations of x -> 2x needed before the result is nondeficient, when starting from x=n; a(n) = 0, when n is a power of 2.

%H Antti Karttunen, <a href="/A336916/b336916.txt">Table of n, a(n) for n = 1..65537</a>

%o (PARI) A336916(n) = if(!bitand(n,n-1), 0, for(i=1,oo,my(n2 = n+n); if(sigma(n) >= n2, return(i)); n = n2));

%Y One more than A336915.

%Y Cf. also A279048, A336835.

%K nonn

%O 1,3

%A _Antti Karttunen_, Aug 08 2020

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.

Last modified September 22 17:39 EDT 2021. Contains 347607 sequences. (Running on oeis4.)