login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099928 Row sums of Pellonomial triangle A099927. 2

%I #17 Nov 17 2022 08:14:01

%S 1,2,4,12,56,408,4608,80784,2201536,93224736,6134017792,627029574336,

%T 99602689462784,24580813373119872,9426621978735869952,

%U 5616371724370667073792,5199854362208758062125056,7479400854548558531507839488,16717751433807850998823619411968

%N Row sums of Pellonomial triangle A099927.

%H Alois P. Heinz, <a href="/A099928/b099928.txt">Table of n, a(n) for n = 0..70</a>

%H S. Falcon, <a href="https://www.saspublishers.com/article/2554/">On The Generating Functions of the Powers of the K-Fibonacci Numbers</a>, Scholars Journal of Engineering and Technology (SJET), 2014; 2 (4C):669-675.

%p p:= proc(n) p(n):= `if`(n<2, n, 2*p(n-1)+p(n-2)) end:

%p f:= proc(n) f(n):= `if`(n=0, 1, p(n)*f(n-1)) end:

%p a:= n-> add(f(n)/(f(k)*f(n-k)), k=0..n):

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Aug 15 2013

%t p[n_] := p[n] = If[n < 2, n, 2*p[n - 1] + p[n - 2]];

%t f[n_] := f[n] = If[n == 0, 1, p[n]*f[n - 1]];

%t T[n_, k_] := f[n]/(f[k]*f[n - k]);

%t a[n_] := Sum[T[n, k], {k, 0, n}];

%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Nov 16 2022, after _Alois P. Heinz_ *)

%K nonn

%O 0,2

%A _Ralf Stephan_, Nov 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 05:46 EDT 2024. Contains 375311 sequences. (Running on oeis4.)