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!)
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; text; internal format)
OFFSET
0,2
COMMENTS
Binomial transform of A093145 without initial 0. Inverse binomial transform of A163147.
LINKS
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).
MATHEMATICA
LinearRecurrence[{12, -31}, {1, 11}, 20] (* Harvey P. Dale, Apr 15 2019 *)
PROG
(Magma) [ n le 2 select 10*n-9 else 12*Self(n-1)-31*Self(n-2): n in [1..20] ];
CROSSREFS
Sequence in context: A113403 A045624 A125399 * A037550 A138894 A287832
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, Jul 21 2009
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 19 03:57 EDT 2024. Contains 371782 sequences. (Running on oeis4.)