Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163146
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163146 a(n) = 12*a(n-1)-31*a(n-2) for n > 1; a(0) = 1, a(1) = 11. +0
3
1, 11, 101, 871, 7321, 60851, 503261, 4152751, 34231921, 282047771, 2323383701, 19137123511, 157620587401, 1298196219971, 10692116430221, 88061314343551, 725280162785761, 5973461208779051, 49197849458990021, 405196896035729671 (list; graph; listen)
OFFSET

0,2

COMMENT

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).

PROGRAM

(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 this_sequence A037550 A138894 A122105

Adjacent sequences: A163143 A163144 A163145 this_sequence A163147 A163148 A163149

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 21 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research