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!)
A025483 a(0) = 0; a(n) = a(n/4)/4 if n = a(n/4) = 0 (mod 4); a(n) = a(n-1)+1 otherwise. 0

%I #5 Mar 30 2012 18:35:25

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,

%T 14,15,16,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,3,4,5,6,7,8,9,10,11,

%U 12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,1,2,3,4,5,6,7,8,9,10

%N a(0) = 0; a(n) = a(n/4)/4 if n = a(n/4) = 0 (mod 4); a(n) = a(n-1)+1 otherwise.

%K nonn

%O 0,3

%A _David W. Wilson_

%E Bounded, conjectured maximum is a(1051) = 31.

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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)