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
%I A141448
%S A141448 0,1,2,5,13,34,89,232,605,1578,4116,10736,28003,73041,190515,496926,
%T A141448 1296147,3380779,8818187,23000741,59993521,156482896,408159020,
%U A141448 1064613385,2776862948,7242974718,18892067685,49276745441,128530009618
%N A141448 Generalized Pell numbers P(n,5,5).
%C A141448 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)
%C A141448 are A077939. P(n,4,1,) and P(n,4,4) are A103142.
%H A141448 E. Kilic, D. Tasci, <a href="http://www.math.nthu.edu.tw/~tjm/abstract/
               0612/0612_18.pdf">, The generalized Binet formula, representation 
               and sums of the generalizedorder-k Pell numbers</a>, Taiwanese J 
               of Math vol 10 no 6 (2006), 1661-1670.
%F A141448 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]
%p A141448 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:
%Y A141448 Sequence in context: A103142 A112844 A027933 this_sequence A011783 A122367 
               A001519
%Y A141448 Adjacent sequences: A141445 A141446 A141447 this_sequence A141449 A141450 
               A141451
%K A141448 easy,nonn
%O A141448 0,3
%A A141448 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 14:30 EST 2009. Contains 167569 sequences.


AT&T Labs Research