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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A163146 a(n) = 12*a(n-1)-31*a(n-2) for n > 1; a(0) = 1, a(1) = 11. 2
1, 11, 101, 871, 7321, 60851, 503261, 4152751, 34231921, 282047771, 2323383701, 19137123511, 157620587401, 1298196219971, 10692116430221, 88061314343551, 725280162785761, 5973461208779051, 49197849458990021, 405196896035729671 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of A093145 without initial 0. Inverse binomial transform of A163147.

FORMULA

a(n) = ((1+sqrt(5))*(6+sqrt(5))^n+(1-sqrt(5))*(6-sqrt(5))^n)/2.

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

PROG

(MAGMA) [ n le 2 select 10*n-9 else 12*Self(n-1)-31*Self(n-2): n in [1..20] ];

CROSSREFS

Cf. A093145, A163147.

Sequence in context: A001603 A045624 A125399 * A037550 A138894 A122105

Adjacent sequences:  A163143 A163144 A163145 * A163147 A163148 A163149

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 21 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 14 06:43 EST 2012. Contains 205576 sequences.