login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133479 a(n) = a(n-1) + 8*a(n-2) for n >= 2, a(0)=1, a(1)=2. 2
1, 2, 10, 26, 106, 314, 1162, 3674, 12970, 42362, 146122, 485018, 1653994, 5534138, 18766090, 63039194, 213167914, 717481466, 2422824778, 8162676506, 27545274730, 92846686778, 313208884618, 1055982378842, 3561653455786 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..24.

Index entries for linear recurrences with constant coefficients, signature (1,8).

FORMULA

G.f.: (1+x)/(1-x-8*x^2).

a(n) = Sum_{k=0..n+1} A122950(n+1,k)*7^(n+1-k). - Philippe Deléham, Jan 08 2008

a(n) = -(1/22)*(1/2 - (1/2)*sqrt(33))^n*sqrt(33) + (1/2)*(1/2 - (1/2)*sqrt(33))^n + (1/22)*sqrt(33)*(1/2 + (1/2)*sqrt(33))^n + (1/2)*(1/2 + (1/2)*sqrt(33))^n, with n >= 0. - Paolo P. Lava, Nov 18 2008

a(n) = ((11+sqrt(33))/22)*(1/2 + (1/2)*sqrt(33))^n + ((11-sqrt(33))/22)*(1/2 - (1/2)*sqrt(33))^n. - Richard Choulet, Nov 20 2008

CROSSREFS

Sequence in context: A322201 A099583 A328743 * A196324 A327841 A196648

Adjacent sequences:  A133476 A133477 A133478 * A133480 A133481 A133482

KEYWORD

easy,nonn

AUTHOR

Philippe Deléham, Jan 03 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 02:50 EDT 2020. Contains 336418 sequences. (Running on oeis4.)