Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105635
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105635 Pell(n+2)/2-(1+(-1)^n)/4. +0
3
0, 1, 2, 6, 14, 35, 84, 204, 492, 1189, 2870, 6930, 16730, 40391, 97512, 235416, 568344, 1372105, 3312554, 7997214, 19306982, 46611179, 112529340, 271669860, 655869060, 1583407981, 3822685022, 9228778026, 22280241074, 53789260175 (list; graph; listen)
OFFSET

0,3

COMMENT

Transform of Pell(n) under the Riordan array (1/(1-x^2),x).

FORMULA

G.f.: x/((1-x^2)(1-2x-x^2)); a(n)=2a(n-1)+2a(n-2)-2a(n-3)-a(n-4); a(n)=sum{k=0..floor((n-1)/2), Pell(n-2k)}; a(n)=sum{k=0..n, Pell(k)*(1-(-1)^(n+k-1))/2};

a(n) = term (4,1) in the 4x4 matrix [1,1,0,0; 3,0,1,0; 1,0,0,0; 1,0,0,1]^n. - Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jul 24 2008

MAPLE

seq(iquo(fibonacci(n, 2), 2), n=1..30); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008

a := n -> (Matrix([[1, 1, 0, 0], [3, 0, 1, 0], [1, 0, 0, 0], [1, 0, 0, 1]])^(n))[4, 1]; seq (a(n), n=0..50); - Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jul 24 2008

CROSSREFS

Cf. A000129.

Adjacent sequences: A105632 A105633 A105634 this_sequence A105636 A105637 A105638

Sequence in context: A059570 A018016 A099425 this_sequence A025257 A110152 A017922

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 16 2005

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research