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!)
A118088 a(0) = 0, a(n) = (1+2*0^(n mod 3))*a(floor(n/3)) + n mod 3. 1

%I #3 Mar 30 2012 18:50:54

%S 0,1,2,3,2,3,6,3,4,9,4,5,6,3,4,9,4,5,18,7,8,9,4,5,12,5,6,27,10,11,12,

%T 5,6,15,6,7,18,7,8,9,4,5,12,5,6,27,10,11,12,5,6,15,6,7,54,19,20,21,8,

%U 9,24,9,10,27,10,11,12,5,6,15,6,7,36,13,14,15,6,7,18,7,8,81,28,29,30,11,12

%N a(0) = 0, a(n) = (1+2*0^(n mod 3))*a(floor(n/3)) + n mod 3.

%C a(0) = 0, a(3*n) = 3*a(n), a(3*n+i) = a(n)+i with 1<=i<=2;

%C A118089(n) = Min{m: a(m) = n}.

%Y Cf. A087808.

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, Apr 12 2006

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)