The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A228305 a(1) = 3; for n >= 1, a(2*n) = 2^(n+1), a(2*n+1) = 5*2^(n-1). 0
3, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 16384, 20480, 32768, 40960, 65536, 81920, 131072, 163840, 262144, 327680, 524288, 655360, 1048576, 1310720, 2097152, 2621440, 4194304, 5242880 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Union of A020714 and A198633.
Essentially the same as A094958.
For every n, a(1)^3 + a(2)^3 + a(3)^3 + ... + a(2*n-1)^3 is a cube.
LINKS
Wikipedia, Cube (algebra)
FORMULA
a(n) = ceiling((9 - (- 1)^n)*2^(floor(n/2) - 2)).
a(n) = n + 2 for n <= 3; a(n) = 2*a(n-2) for n > 3.
From Bruno Berselli, Aug 20 2013: (Start)
G.f.: x*(3+4*x-x^2)/(1-2*x^2).
a(n) = (16-(8-5*r)*(1-(-1)^n))*r^(n-6) for n>1, r=sqrt(2). (End)
EXAMPLE
a(9) = 40 because it is equal to 5*2^(4-1).
MATHEMATICA
CoefficientList[Series[(3 + 4 x - x^2)/(1 - 2 x^2), {x, 0, 50}], x] (* Bruno Berselli, Aug 20 2013 *)
PROG
(Magma) [n le 3 select n+2 else 2*Self(n-2) : n in [1..43]]
(PARI) r=43; print1(3); print1(", "); for(n=2, r, if(bitand(n, 1), print1(5*2^((n-3)/2)), print1(2^(n/2+1))); print1(", "));
CROSSREFS
Sequence in context: A211533 A079136 A235862 * A103329 A080726 A101210
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 May 14 11:58 EDT 2024. Contains 372532 sequences. (Running on oeis4.)