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!)
A249101 p(n,1), where p(n,x) is defined in Comments; sum of numbers in row n of the array at A249100. 2

%I #17 Oct 28 2022 09:58:01

%S 1,4,9,37,118,525,2059,9934,44937,233683,1177360,6552069,35986069,

%T 212891932,1256487933,7856137825,49320239614,324285063489,

%U 2149133929207,14796251405278,102910742502765,739149552929719,5370132965554144,40110161953250937

%N p(n,1), where p(n,x) is defined in Comments; sum of numbers in row n of the array at A249100.

%C The polynomial p(n,x) is the numerator of the rational function given by f(n,x) = x + (2*n - 1)/f(n-1,x), where f(1,x) = 1.

%F a(n) = a(n-1) + (2*n-1)*a(n-2), a(0) = a(1) = 1. - _Michael Somos_, Oct 27 2022

%e First 3 rows from A249100:

%e 1;

%e 3, 1;

%e 5, 3, 1;

%e so that the first 3 terms of A249101 are 1, 4, 9.

%t z = 11; p[n_, x_] := x + (2 n - 1)/p[n-1,x]; p[1,x_] = 1;

%t t = Table[Factor[p[n,x]], {n, 1, z}]

%t u = Numerator[t]; v = u /. x -> 1 (* A249101 *)

%t a[ n_] := (a[n] = If[n<2, Boole[n>=0], a[n-1] + (2*n-1)*a[n-2]]); (* _Michael Somos_, Oct 27 2022 *)

%o (PARI) {a(n) = if(n<2, n>=0, a(n-1) + (2*n-1)*a(n-2))}; /* _Michael Somos_, Oct 27 2022 */

%Y Cf. A249100.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Oct 21 2014

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 April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)