Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163066
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163066 a(n) = 12*a(n-1)-31*a(n-2) for n > 1; a(0) = 2, a(1) = 17. +0
2
2, 17, 142, 1177, 9722, 80177, 660742, 5443417, 44838002, 369310097, 3041743102, 25052304217, 206333614442, 1699381942577, 13996241263222, 115274054938777, 949405180105442, 7819366458163217, 64400836914689902, 530409682773219097 (list; graph; listen)
OFFSET

0,1

COMMENT

Binomial transform of A162773. Inverse binomial transform of A163067.

FORMULA

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

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

PROGRAM

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

CROSSREFS

Cf. A162773, A163067.

Sequence in context: A037573 A037741 A037636 this_sequence A110815 A074624 A126037

Adjacent sequences: A163063 A163064 A163065 this_sequence A163067 A163068 A163069

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 20 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research