A193657 -id:A193657 - cp's OEIS frontend

A193649 Q-residue of the (n+1)st Fibonacci polynomial, where Q is the triangular array (t(i,j)) given by t(i,j)=1. (See Comments.)

1, 1, 3, 5, 15, 33, 91, 221, 583, 1465, 3795, 9653, 24831, 63441, 162763, 416525, 1067575, 2733673, 7003971, 17938661, 45954543, 117709185, 301527355, 772364093, 1978473511

Offset: 0

Clark Kimberling, Aug 02 2011

nonn

Suppose that p=p(0)*x^n+p(1)*x^(n-1)+...+p(n-1)*x+p(n) is a polynomial of positive degree and that Q is a sequence of polynomials: q(k,x)=t(k,0)*x^k+t(k,1)*x^(k-1)+...+t(k,k-1)*x+t(k,k), for k=0,1,2,... The Q-downstep of p is the polynomial given by D(p)=p(0)*q(n-1,x)+p(1)*q(n-2,x)+...+p(n-1)*q(0,x)+p(n).

Since degree(D(p))

Example: let p(x)=2*x^3+3*x^2+4*x+5 and q(k,x)=(x+1)^k.

D(p)=2(x+1)^2+3(x+1)+4(1)+5=2x^2+7x+14

D(D(p))=2(x+1)+7(1)+14=2x+23

D(D(D(p)))=2(1)+23=25;

the Q-residue of p is 25.

We may regard the sequence Q of polynomials as the triangular array formed by coefficients:

t(0,0)

t(1,0)....t(1,1)

t(2,0)....t(2,1)....t(2,2)

t(3,0)....t(3,1)....t(3,2)....t(3,3)

and regard p as the vector (p(0),p(1),...,p(n)). If P is a sequence of polynomials [or triangular array having (row n)=(p(0),p(1),...,p(n))], then the Q-residues of the polynomials form a numerical sequence.

Following are examples in which Q is the triangle given by t(i,j)=1 for 0<=i<=j:

Q.....P...................Q-residue of P

1.....1...................A000079, 2^n

1....(x+1)^n..............A007051, (1+3^n)/2

1....(x+2)^n..............A034478, (1+5^n)/2

1....(x+3)^n..............A034494, (1+7^n)/2

1....(2x+1)^n.............A007582

1....(3x+1)^n.............A081186

1....(2x+3)^n.............A081342

1....(3x+2)^n.............A081336

1.....A040310.............A193649

1....(x+1)^n+(x-1)^n)/2...A122983

1....(x+2)(x+1)^(n-1).....A057198

1....(1,2,3,4,...,n)......A002064

1....(1,1,2,3,4,...,n)....A048495

1....(n,n+1,...,2n).......A087323

1....(n+1,n+2,...,2n+1)...A099035

1....p(n,k)=(2^(n-k))*3^k.A085350

1....p(n,k)=(3^(n-k))*2^k.A090040

1....A008288 (Delannoy)...A193653

1....A054142..............A101265

1....cyclotomic...........A193650

1....(x+1)(x+2)...(x+n)...A193651

1....A114525..............A193662

More examples:

Q...........P.............Q-residue of P

(x+1)^n...(x+1)^n.........A000110, Bell numbers

(x+1)^n...(x+2)^n.........A126390

(x+2)^n...(x+1)^n.........A028361

(x+2)^n...(x+2)^n.........A126443

(x+1)^n.....1.............A005001

(x+2)^n.....1.............A193660

A094727.....1.............A193657

(k+1).....(k+1)...........A001906 (even-ind. Fib. nos.)

(k+1).....(x+1)^n.........A112091

(x+1)^n...(k+1)...........A029761

(k+1)......A049310........A193663

(In these last four, (k+1) represents the triangle t(n,k)=k+1, 0<=k<=n.)

A051162...(x+1)^n.........A193658

A094727...(x+1)^n.........A193659

A049310...(x+1)^n.........A193664

A075362....A075362........A193665

Changing the notation slightly leads to the Mathematica program below and the following formulation for the Q-downstep of p: first, write t(n,k) as q(n,k). Define r(k)=Sum{q(k-1,i)*r(k-1-i) : i=0,1,...,k-1} Then row n of D(p) is given by v(n)=Sum{p(n,k)*r(n-k) : k=0,1,...,n}.

			First five rows of Q, coefficients of Fibonacci polynomials (A049310):
1
1...0
1...0...1
1...0...2...0
1...0...3...0...1
To obtain a(4)=15, downstep four times:
D(x^4+3*x^2+1)=(x^3+x^2+x+1)+3(x+1)+1: (1,1,4,5) [coefficients]
DD(x^4+3*x^2+1)=D(1,1,4,5)=(1,2,11)
DDD(x^4+3*x^2+1)=D(1,2,11)=(1,14)
DDDD(x^4+3*x^2+1)=D(1,14)=15.

Cf. A192872 (polynomial reduction), A193091 (polynomial augmentation), A193722 (the upstep operation and fusion of polynomial sequences or triangular arrays).

q[n_, k_] := 1;
r[0] = 1; r[k_] := Sum[q[k - 1, i] r[k - 1 - i], {i, 0, k - 1}];
f[n_, x_] := Fibonacci[n + 1, x];
p[n_, k_] := Coefficient[f[n, x], x, k]; (* A049310 *)
v[n_] := Sum[p[n, k] r[n - k], {k, 0, n}]
Table[v[n], {n, 0, 24}]    (* A193649 *)
TableForm[Table[q[i, k], {i, 0, 4}, {k, 0, i}]]
Table[r[k], {k, 0, 8}]  (* 2^k *)
TableForm[Table[p[n, k], {n, 0, 6}, {k, 0, n}]]

Conjecture: G.f.: -(1+x)*(2*x-1) / ( (x-1)*(4*x^2+x-1) ). - R. J. Mathar, Feb 19 2015

A193668 a(n) = Sum_{i=0..n-1} (n+i)*a(n-1-i) for n>1, a(0)=1, a(1)=1.

Original entry on oeis.org

1, 1, 5, 24, 134, 866, 6392, 53198, 493628, 5057522, 56741240, 692118422, 9122245508, 129220379978, 1958059133552, 31607140330670, 541515698082332, 9814691158604258, 187629572002767848, 3773371262361852422, 79636835475910932020

Offset: 0

Clark Kimberling, Aug 02 2011

nonn

Occurs in making the Q-residue A193657.

Second difference of A002627. - Peter Luschny, May 30 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A193657, A002627.

a := n -> `if`(n=0,1,(n-n^2-1)*GAMMA(n)+exp(1)*((1-n)*GAMMA(n,1) + n*GAMMA(n+1, 1))): seq(simplify(a(n)),n=0..20); # Peter Luschny, May 30 2014

(See A193657.)
Flatten[{1,RecurrenceTable[{(n-2)*a[n-2] - (n+2)*a[n-1] + a[n] == 0, a[1]==1, a[2]==5}, a, {n, 20}]}] (* Vaclav Kotesovec, Nov 20 2012 *)
CoefficientList[Series[Log[x-1]+E*Gamma[0,1-x]-E*Gamma[0,1]+1-I*Pi+(E^x*x-x^2)/(x-1)^2, {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Nov 20 2012 *)

a(n)=if(n<2,1,sum(i=0,n-1,(n+i)*a(n-1-i))) \\ Charles R Greathouse IV, May 30 2014

Recurrence: a(n) = (n+2)*a(n-1) - (n-2)*a(n-2). - Vaclav Kotesovec, Nov 20 2012
a(n) ~ n!*n*(e-1). - Vaclav Kotesovec, Nov 20 2012
a(n) = (n-n^2-1)*Gamma(n) + e*(n*Gamma(n+1,1)-(n-1)*Gamma(n,1)) for n>0. - Peter Luschny, May 30 2014.

A345887 Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the largest cell covered.

Original entry on oeis.org

1, 6, 30, 164, 1030, 7422, 60620, 554248, 5611770, 62353010, 754471432, 9876716940, 139097096918, 2097156230470, 33704296561140, 575219994643472, 10389911153247730, 198019483156015578, 3971390745517868000, 83608226221428800020, 1843561388182505040462

Offset: 1

Lara Pudwell, Jun 28 2021

nonn

Jonathan Beagley and Lara Pudwell, Colorful Tilings and Permutations, Journal of Integer Sequences, Vol. 24 (2021), Article 21.10.4.

Cf. A002627, A193657.

a:= proc(n) a(n):= `if`(n=1, 1, a(n-1)*n^2/(n-1)+n) end:
seq(a(n), n=1..21);  # Alois P. Heinz, Jun 28 2021

With[{r = Range[21]}, r*Rest@ FoldList[Times @@ {##} + 1 &, 0, r]] (* Michael De Vlieger, Jun 28 2021 *)

a(n) = n*sum(k=1, n, n!/k!); \\ Michel Marcus, Jun 29 2021

a(n) = n * Sum_{k=1..n} n!/k!.
a(n) = n * A002627(n).
From Alois P. Heinz, Jun 28 2021: (Start)
E.g.f.: (exp(x)-x)/(x-1)^2 - exp(x).
a(n) = A193657(n) - 1. (End)
D-finite with recurrence a(n) +(-n-2)*a(n-1) +(n-1)*a(n-2) -2 =0. - R. J. Mathar, Jan 11 2024

Showing 1-3 of 3 results.

cp's OEIS Frontend

A193649 Q-residue of the (n+1)st Fibonacci polynomial, where Q is the triangular array (t(i,j)) given by t(i,j)=1. (See Comments.)

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A193668 a(n) = Sum_{i=0..n-1} (n+i)*a(n-1-i) for n>1, a(0)=1, a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A345887 Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the largest cell covered.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula