Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141448
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141448 Generalized Pell numbers P(n,5,5). +0
1
0, 1, 2, 5, 13, 34, 89, 232, 605, 1578, 4116, 10736, 28003, 73041, 190515, 496926, 1296147, 3380779, 8818187, 23000741, 59993521, 156482896, 408159020, 1064613385, 2776862948, 7242974718, 18892067685, 49276745441, 128530009618 (list; graph; listen)
OFFSET

0,3

COMMENT

P(n,2,2) and P(n,2,1) are in A000129. P(n,3,2) is A116413. P(n,3,1) and P(n,3,3)

are A077939. P(n,4,1,) and P(n,4,4) are A103142.

LINKS

E. Kilic, D. Tasci, , The generalized Binet formula, representation and sums of the generalizedorder-k Pell numbers, Taiwanese J of Math vol 10 no 6 (2006), 1661-1670.

FORMULA

a(n)=2*a(n-1)+a(n-2)+a(n-3)+a(n-4)+a(n-5). G.f.: x/(1-2x-x^2-x^3-x^4-x^5). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 28 2008]

MAPLE

P := proc(n, k, i) option remember ; if n = 1-i then 1; elif n <= 0 then 0; else 2*P(n-1, k, i)+add(P(n-j, k, i), j=2..k) ; fi ; end: for n from 0 to 40 do printf("%d, ", P(n, 5, 5)) ; od:

CROSSREFS

Sequence in context: A103142 A112844 A027933 this_sequence A011783 A122367 A001519

Adjacent sequences: A141445 A141446 A141447 this_sequence A141449 A141450 A141451

KEYWORD

easy,nonn

AUTHOR

R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 07 2008

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research