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!)
A132723 Binomial transform of A132429. 1
3, 4, 4, 0, -8, -16, -16, 0, 32, 64, 64, 0, -128, -256, -256, 0, 512, 1024, 1024, 0, -2048, -4096, -4096, 0, 8192, 16384, 16384, 0, -32768, -65536, -65536, 0, 131072, 262144, 262144, 0, -524288, -1048576, -1048576 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Sequence is identical to its fourth differences.
LINKS
FORMULA
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n positive. For a(0)=3,a(1)=a(2)=4,a(3)=0.
From R. J. Mathar, Apr 02 2008: (Start)
O.g.f.: 1 + 2/(1 -2*x +2*x^2).
a(n) = 2*a(n-1) - 2*a(n-2) if n>2. (End)
E.g.f.: 1 + 2*sqrt(2)*exp(x)*sin(x + Pi/4). - G. C. Greubel, Feb 14 2021
MATHEMATICA
Join[{3}, LinearRecurrence[{2, -2}, {4, 4}, 50]] (* Harvey P. Dale, Mar 06 2014 *)
Table[If[n<2, n+3, 2*((1+I)^(n-1) + (1-I)^(n-1))], {n, 0, 40}] (* G. C. Greubel, Feb 14 2021 *)
PROG
(Sage)
def A132723(n): return n+3 if (n<2) else 2*( (1+i)^(n-1) + (1-i)^(n-1) )
[A132723(n) for n in (0..40)] # G. C. Greubel, Feb 14 2021
(Magma) [3] cat [n le 2 select 4 else 2*(Self(n-1) - Self(n-2)): n in [1..40]]; // G. C. Greubel, Feb 14 2021
CROSSREFS
Sequence in context: A222500 A177935 A021748 * A260180 A057279 A350908
KEYWORD
sign
AUTHOR
Paul Curtz, Nov 16 2007
EXTENSIONS
More terms from R. J. Mathar, Apr 02 2008
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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)