login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153267 a(n) = -4*a(n-3) + 11*a(n-2) - a(n-1), a(0) = -5, a(1) = 39, a(2) = -110 3
-5, 39, -110, 559, -1925, 8514, -31925, 133279, -518510, 2112279, -8349005, 33658114, -133946285, 537581559, -2145623150, 8594805439, -34346986325, 137472338754, -549668410085, 2199252081679, -8795493947630, 35185940486439 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

A153266(n) + a(n) = 4*A001519(n) (apart from initial terms). The generating floretion Z = X*Y with X = 1.5'i + 0.5i' + .25(ii + jj + kk + ee) and Y = 0.5'i + 1.5i' + .25(ii + jj + kk + ee)

FORMULA

a(n) = 2*(-4)^n + 3/2+1/2*sqrt(5))^n + (3/2-1/2*sqrt(5))^n

EXAMPLE

a(4) = -1*559 + 11*(-110) - 4*(39) = -1925

CROSSREFS

A153266, A153265, A001519

Sequence in context: A110467 A095230 A171555 * A183477 A064445 A123614

Adjacent sequences:  A153264 A153265 A153266 * A153268 A153269 A153270

KEYWORD

easy,sign

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jan 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 11:07 EST 2012. Contains 205459 sequences.