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!)
A200069 a(n) = 4*a(n-1) + 13*a(n-2) for n>2, a(1)=1, a(2)=4. 3
1, 4, 29, 168, 1049, 6380, 39157, 239568, 1467313, 8983636, 55009613, 336825720, 2062427849, 12628445756, 77325345061, 473471175072, 2899114186081, 17751582020260, 108694812500093, 665549816263752, 4075231827556217, 24953074921653644, 152790313444845397 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
De Moivres formula : a(n)=(r^n-s^n)/(r-s), for r>s gives sequences with integers if r and s are conjugates. With r=2+sqrt(17) and s=2-sqrt(17), a(n+1)/a(n) converges to 2+sqrt(17).
LINKS
FORMULA
a(n) = ((2+sqrt(17))^n-(2-sqrt(17))^n)/(2*sqrt(17)).
G.f.: x/(1-4*x-13*x^2). - Bruno Berselli, Nov 15 2011
EXAMPLE
a(3) = 4*4+13*1 = 29.
MATHEMATICA
LinearRecurrence[{4, 13}, {1, 4}, 50]
PROG
(Haskell)
a200069 n = a200069_list !! (n-1)
a200069_list = 1 : 4 : zipWith (+)
(map (* 4) $ tail a200069_list) (map (* 13) a200069_list)
-- Reinhard Zumkeller, Nov 15 2011
CROSSREFS
Cf. A041025.
Sequence in context: A326100 A273209 A273271 * A302803 A300806 A303464
KEYWORD
nonn,easy
AUTHOR
Sture Sjöstedt, Nov 13 2011
EXTENSIONS
More terms from Bruno Berselli, Nov 15 2011
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)