Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A192944

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x)=(x+1)(x+2)...(x+F(n+1)), where F=A000045, the Fibonacci sequence.
(history; published version)
#8 by Alois P. Heinz at Sat Jul 27 19:29:40 EDT 2019
STATUS

proposed

approved

#7 by G. C. Greubel at Fri Jul 26 15:52:13 EDT 2019
STATUS

editing

proposed

#6 by G. C. Greubel at Fri Jul 26 15:52:06 EDT 2019
NAME

Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x)=(x+1)(x+2)...(x+F(n+1)), where F=A000045, the Fibonacci sequence.

COMMENTS

For an introduction to reductions of polynomials by substitutions such as x^2 -> x+1, see A192232.

LINKS

G. C. Greubel, <a href="/A192944/b192944.txt">Table of n, a(n) for n = 0..97</a>

EXAMPLE

p(0,x) = 1

p(1,x) = x+1 -> 1+x

p(2,x) = (x+1)(x+2) -> 3+4x

p(3,x) = (x+1)(x+2)(x+3) -> 13+19x

MATHEMATICA

(See A192943.)

q = x^2; s = x + 1; z = 26;

p[0, x]:= 1;

p[n_, x_]:= (x + Fibonacci[n+1])*p[n-1, x];

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

reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1]

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

u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A192943 *)

u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192944 *)

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:57:37 EDT 2012
AUTHOR

_Clark Kimberling (ck6(AT)evansville.edu), _, Jul 13 2011

Discussion
Fri Mar 30
18:57
OEIS Server: https://oeis.org/edit/global/285
#4 by T. D. Noe at Wed Jul 13 20:19:14 EDT 2011
STATUS

proposed

approved

#3 by Clark Kimberling at Wed Jul 13 20:08:58 EDT 2011
STATUS

editing

proposed

#2 by Clark Kimberling at Wed Jul 13 13:01:37 EDT 2011
NAME

allocated for Clark KimberlingCoefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x)=(x+1)(x+2)...(x+F(n+1)), where F=A000045, the Fibonacci sequence.

DATA

0, 1, 4, 19, 127, 1227, 17977, 407108, 14510651, 821907178, 74498246381, 10849935064552, 2545826568211757, 963950723522943935, 589590299737652176495, 582892188767255266969095, 931834379222684656945128850, 2409387593714287957763063565225

OFFSET

0,3

COMMENTS

For an introduction to reductions of polynomials by substitutions such as x^2->x+1, see A192232.

EXAMPLE

The first four polynomials p(n,x) and their reductions are as follows:

p(0,x)=1

p(1,x)=x+1 -> 1+x

p(2,x)=(x+1)(x+2) -> 3+4x

p(3,x)=(x+1)(x+2)(x+3) -> 13+19x

From these, read

A192943=(1,1,3,13,...) and A192944=(0,1,4,19,...)

MATHEMATICA

(See A192943.)

CROSSREFS
KEYWORD

allocated

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jul 13 2011

STATUS

approved

editing

#1 by Clark Kimberling at Wed Jul 13 12:04:28 EDT 2011
NAME

allocated for Clark Kimberling

KEYWORD

allocated

STATUS

approved