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!)
A157176 a(n+1) = a(n - n mod 2) + a(n - n mod 3), a(0) = 1. 9

%I #2 Mar 30 2012 18:51:04

%S 1,2,2,3,5,8,8,16,16,24,40,64,64,128,128,192,320,512,512,1024,1024,

%T 1536,2560,4096,4096,8192,8192,12288,20480,32768,32768,65536,65536,

%U 98304,163840,262144,262144,524288,524288,786432,1310720,2097152,2097152

%N a(n+1) = a(n - n mod 2) + a(n - n mod 3), a(0) = 1.

%C a(6*k) = 8^k; a(A008588(n))=A001018(n);

%C a(6*k+1) = a(6*k+2) = 2*8^k; a(A016921(n))=a(A016933(n))=A013730(n);

%C a(6*k+3) = 3*8^k; a(A016945(n))=A103333(n+1);

%C a(6*k+4) = 5*8^k; a(A016957(n))=A067412(n+1);

%C a(6*k+5) = 8^(k+1); a(A016969(n))=A001018(n+1).

%F a(n+6) = 8*a(n).

%K nonn

%O 0,2

%A _Reinhard Zumkeller_, Feb 24 2009

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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)