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!)
A117902 Expansion of (1-x^2-2x^3)/(1-4x^3). 3
1, 0, -1, 2, 0, -4, 8, 0, -16, 32, 0, -64, 128, 0, -256, 512, 0, -1024, 2048, 0, -4096, 8192, 0, -16384, 32768, 0, -65536, 131072, 0, -262144, 524288, 0, -1048576, 2097152, 0, -4194304, 8388608, 0, -16777216, 33554432, 0, -67108864, 134217728, 0, -268435456, 536870912, 0, -1073741824 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Row sums of number triangle A117901.
LINKS
FORMULA
a(n) = 0^n/2 - (2^(2*n/3)/12)*( 2*cos((2*n+1)*Pi*n/3) + 2*sqrt(3)*sin((2*n+1)*Pi*n/3) -(2^(2/3) + 8)*cos(2*Pi*n/3) - 2^(1/6)*sqrt(6)*sin(2*Pi*n/3) + 2^(2/3) - 2 ).
a(n) = (1/2)*[n=0] + 2*A133851(n-3) - A133851(n-2). - G. C. Greubel, Oct 09 2021
MATHEMATICA
LinearRecurrence[{0, 0, 4}, {1, 0, -1, 2}, 50] (* G. C. Greubel, Oct 09 2021 *)
PROG
(Magma) [1] cat [n le 3 select (-1)^(n-1)*(n-1) else 4*Self(n-3): n in [1..50]]; // G. C. Greubel, Oct 09 2021
(Sage)
def A133851(n): return 4^(n/3) if (n%3==0) else 0
def A117902(n): return bool(n==0)/2 + 2*A133851(n-3) - A133851(n-2)
[A117902(n) for n in (0..50)] # G. C. Greubel, Oct 09 2021
CROSSREFS
Sequence in context: A011121 A255643 A230277 * A021087 A120558 A354042
KEYWORD
easy,sign
AUTHOR
Paul Barry, Apr 01 2006
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 April 23 02:14 EDT 2024. Contains 371906 sequences. (Running on oeis4.)