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!)
A192748 Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments. 2

%I #6 May 04 2014 16:52:09

%S 0,1,4,11,24,47,86,151,258,433,718,1181,1932,3149,5120,8311,13476,

%T 21835,35362,57251,92670,149981,242714,392761,635544,1028377,1663996,

%U 2692451,4356528,7049063,11405678,18454831,29860602,48315529,78176230

%N Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.

%C The titular polynomial is defined recursively by p(n,x)=x*(n-1,x)+3n for n>0, where p(0,x)=1. For discussions of polynomial reduction, see A192232 and A192744.

%F Conjecture: G.f.: -x^2*(1+x+x^2) / ( (x^2+x-1)*(x-1)^2 ), so the first differences are in A154691. - _R. J. Mathar_, May 04 2014

%t q = x^2; s = x + 1; z = 40;

%t p[0, n_] := 1; p[n_, x_] := x*p[n - 1, x] + 3 n;

%t Table[Expand[p[n, x]], {n, 0, 7}]

%t reduce[{p1_, q_, s_, x_}] :=

%t FixedPoint[(s PolynomialQuotient @@ #1 +

%t PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1]

%t t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}];

%t u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}]

%t (* A154691 *)

%t u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}]

%t (* A192748 *)

%Y Cf. A192744, A192232.

%K nonn

%O 1,3

%A _Clark Kimberling_, Jul 09 2011

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 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)