|
Search: id:A087455
|
|
|
| A087455 |
|
Expansion of (1-x)/(1-2x+3x^2). |
|
+0
7
|
|
| 1, 1, -1, -5, -7, 1, 23, 43, 17, -95, -241, -197, 329, 1249, 1511, -725, -5983, -9791, -1633, 26107, 57113, 35905, -99529, -306773, -314959, 290401, 1525679, 2180155, -216727, -6973919, -13297657, -5673557, 28545857, 74112385, 62587199, -97162757, -382087111, -472685951
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Type 2 generalized Gaussian Fibonacci integers.
Binomial transform of A077966 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 02 2008]
|
|
REFERENCES
|
S. Severini, A note on two integer sequences arising from the 3-dimensional hypercube, Technical Report, Department of Computer Science, University of Bristol, Bristol, UK (October 2003).
|
|
LINKS
|
C. Dement, The Math Forum.
|
|
FORMULA
|
Additional formulae from Paul Barry, Sep 03 2004: a(n)=2a(n-1)-3a(n-2); a(n)=(-1)^n*sum{m=0..n, binomial(n, m)*sum{k=0..n, binomial(m, 2k)2^(m-k)}}; binomial transform of 1/(1+2x^2), or (1, 0, -2, 0, 4, 0, -8, 0, 16, ...).
a(n)=(3^(n/2))cos(n*arctan(sqrt(2))).
a(n) = sqrt[ves(x^n)]/3 - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jul 31 2004
a(n+1) = a(n+2) - 2*A088137(n+1), a(n+1) = A088137(n+2) - A088137(n+1) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Oct 28 2004
a(n) = 2*a(n-1) - 3*a(n-2), n>1 a(n) = upper left and lower right terms of [1,-2, 1,1]^n. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 28 2008
a(n)=Sum_{k, 0<=k<=n}A098158(n,k)*(-2)^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 14 2008]
a(n)=Sum_{k, 0<=k<=n}A124182(n,k)*(-3)^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 15 2008]
a(n)=(1/2)*{[1-I*sqrt(2)]^n+[1+I*sqrt(2)]^n}, with n>=0 and I=sqrt(-1) [From Paolo P. Lava (ppl(AT)spl.at), Nov 20 2008]
|
|
MAPLE
|
Digits:=100; a:=n->round(abs(evalf((3^(n/2))*cos(n*arctan(sqrt(2))))));
|
|
PROGRAM
|
(PARI) {a(n)=if(n<0, 0, real((1+quadgen(-8))^n))} /* Michael Somos Jul 26 2006 */
(PARI) {a(n)=if(n<0, 0, subst(poltchebi(n), 'x, quadgen(12)/3)*quadgen(12)^n)} /* Michael Somos Jul 26 2006 */
|
|
CROSSREFS
|
Cf. A088137, A084102, A088138.
Cf. A048473.
Sequence in context: A145737 A108763 A061415 this_sequence A117759 A021640 A155968
Adjacent sequences: A087452 A087453 A087454 this_sequence A087456 A087457 A087458
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Simone Severini (severini(AT)cs.bris.ac.uk), Oct 23 2003. The explicit formula was given by Paul Barry.
|
|
EXTENSIONS
|
Corrected and extended by N. J. A. Sloane (njas(AT)research.att.com), Aug 01, 2004
More terms from Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jul 31 2004
|
|
|
Search completed in 0.002 seconds
|
