A001594 -id:A001594 - cp's OEIS frontend

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

1, 1, 3, 8, 29, 133, 762, 5215, 41257, 369032, 3676209, 40333241, 483094250, 6271446691, 87705811341, 1314473334832, 21017294666173, 357096406209005, 6424799978507178, 122024623087820183, 2439706330834135361, 51219771117454755544

Offset: 0

Clark Kimberling, Jul 09 2011

nonn

The titular polynomial is defined recursively by p(n,x)=x*p(n-1,x)+n! for n>0, where p(0,x)=1; see the Example.  For an introduction to polynomial reduction, see A192232.  The discussion at A192232 Comments continues here:
...
Let R(p,q,s) denote the "reduction of polynomial p by q->s" as defined at A192232.  Suppose that q(x)=x^k for some k>0 and that s(x)=s(k,0)*x^(k-1)+s(k,1)*x^(k-2)+...+s(k,k-2)x+s(k,k-1).
...
First, we shall take p(x)=x^n, where n>=0; the results will be used to formulate R(p,q,s) for general p.  Represent R(x^n,q,s) by
...
R(x^n)=s(n,0)*x^(k-1)+s(n,1)*x^(k-2)+...+s(n,k-2)*x+s(n,k-1).
...
Then each of the sequences u(n)=s(n,h), for h=0,1,...,k-1, satisfies this linear recurrence relation:
...
u(n)=s(k,0)*u(n-1)+s(k,1)*u(n-2)+...+s(k,k-2)*u(n-k-1)+s(k,k-1)*u(n-k), with initial values tabulated here:
...
n: ..s(n,0)...s(n,1)..s(n,2).......s(n,k-2)..s(n,k-1)
0: ....0........0.......0..............0.......1
1: ....0........0.......0..............1.......0
...
k-2: ..0........1.......0..............0.......0
k-1: ..0........0.......0..............0.......0
k: ..s(k,0)...s(k,1)..s(k,2).......s(k,k-2)..s(k,k-1)
...
That completes the formulation for p(x)=x^n.  Turning to the general case, suppose that
...
p(n,x)=p(n,0)*x^n+p(n,1)*x^(n-1)+...+p(n,n-1)*x+p(n,n)
...
is a polynomial of degree n>=0.  Then the reduction denoted by (R(p(n,x) by x^k -> s(x)) is the polynomial of degree k-1 given by the matrix product P*S*X, where P=(p(n,0)...p(n,1).........p(n-k)...p(n,n-k+1); X has all 0's except for main diagonal (x^(k-1), x^(k-2)...x,1); and S has
...
row 1: ... s(n,0) ... s(n,1) ...... s(n,k-2) . s(n,k-1)
row 2: ... s(n-1,0) . s(n-1,1) .... s(n-1,k-2) s(n-1,k-1)
...
row n-k+1: s(k,0).... s(k,1) ...... s(k,k-2) ..s(k,k-1)
row n-k+2: p(n,n-k+1) p(n,n-k+2) .. p(n,n-1) ..p(n,n)
*****
As a class of examples, suppose that (v(n)), for n>=0, is a sequence, that p(0,x)=1, and p(n,x)=v(n)+p(n-1,x) for n>0.  If q(x)=x^2 and s(x)=x+1, and we write the reduction R(p(n,x)) as u1(n)*x+u2(n), then the sequences u1 and u2 are convolutions with the Fibonacci sequence, viz., let F=(0,1,1,2,3,5,8,...)=A000045 and let G=(1,0,1,1,2,3,5,8...); then u1=G**v and u2=F**v, where ** denotes convolution.  Examples (with a few exceptions for initial terms):
...
If v(n)=n! then u1=A192744, u2=A192745.
If v(n)=n+1 then u1=A000071, u2=A001924.
If v(n)=2n then u1=A014739, u2=A027181.
If v(n)=2n+1 then u1=A001911, u2=A001891.
If v(n)=3n+1 then u1=A027961, u2=A023537.
If v(n)=3n+2 then u1=A192746, u2=A192747.
If v(n)=3n then u1=A154691, u2=A192748.
If v(n)=4n+1 then u1=A053311, u2=A192749.
If v(n)=4n+2 then u1=A192750, u2=A192751.
If v(n)=4n+3 then u1=A192752, u2=A192753.
If v(n)=4n then u1=A147728, u2=A023654.
If v(n)=5n+1 then u1=A192754, u2=A192755.
If v(n)=5n then u1=A166863, u2=A192756.
If v(n)=floor((n+1)tau) then u1=A192457, u2=A023611.
If v(n)=floor((n+2)/2) then u1=A052952, u2=A129696.
If v(n)=floor((n+3)/3) then u1=A004695, u2=A178982.
If v(n)=floor((n+4)/4) then u1=A080239, u2=A192758.
If v(n)=floor((n+5)/5) then u1=A124502, u2=A192759.
If v(n)=n+2 then u1=A001594, u2=A192760.
If v(n)=n+3 then u1=A022318, u2=A192761.
If v(n)=n+4 then u1=A022319, u2=A192762.
If v(n)=2^n then u1=A027934, u2=A008766.
If v(n)=3^n then u1=A106517, u2=A094688.

			The first five polynomials and their reductions:
1 -> 1
1+x -> 1+x
2+x+x^2 -> 3+2x
6+2x+x^2+x^3 -> 8+5x
24+6x+2x^2+x^3+x^4 -> 29+13x, so that
A192744=(1,1,3,8,29,...) and A192745=(0,1,2,5,13,...).

Cf. A192232.

A192744p := proc(n,x)
    option remember;
    if n = 0 then
        1;
    else
        x*procname(n-1,x)+n! ;
        expand(%) ;
    end if;
end proc:
A192744 := proc(n)
    local p;
    p := A192744p(n,x) ;
    while degree(p,x) > 1 do
        p := algsubs(x^2=x+1,p) ;
        p := expand(p) ;
    end do:
    coeftayl(p,x=0,0) ;
end proc: # R. J. Mathar, Dec 16 2015

q = x^2; s = x + 1; z = 40;
p[0, n_] := 1; p[n_, x_] := x*p[n - 1, x] + n!;
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}]
  (* A192744 *)
u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}]
  (* A192745 *)

G.f.: (1-x)/(1-x-x^2)/Q(0), where Q(k)= 1 - x*(k+1)/(1 - x*(k+1)/Q(k+1)); (continued fraction). - Sergei N. Gladkovskii, May 20 2013
Conjecture: a(n) +(-n-2)*a(n-1) +2*(n-1)*a(n-2) +3*a(n-3) +(-n+2)*a(n-4)=0. - R. J. Mathar, May 04 2014
Conjecture: (-n+2)*a(n) +(n^2-n-1)*a(n-1) +(-n^2+3*n-3)*a(n-2) -(n-1)^2*a(n-3)
=0. - R. J. Mathar, Dec 16 2015

A001596 a(n) = 7^n + n^7.

Original entry on oeis.org

1, 8, 177, 2530, 18785, 94932, 397585, 1647086, 7861953, 45136576, 292475249, 1996813914, 13877119009, 96951758924, 678328486353, 4747732369318, 33233199005057, 232630924325880, 1628414210130481

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (15,-84,252,-462,546,-420,204,-57,7).

Cf. A001580, A001585, A001589, A001593, A001594.

[7^n+n^7: n in [0..30]]; // Vincenzo Librandi, Oct 27 2011

seq(seq(k^n+n^k, k=7..7), n=0..18); # Zerinvary Lajos, Jun 29 2007

f[n_]:=7^n+n^7;f[Range[0,40]] (* Vladimir Joseph Stephan Orlovsky, Feb 14 2011 *)
LinearRecurrence[{15,-84,252,-462,546,-420,204,-57,7},{1,8,177,2530,18785,94932,397585,1647086,7861953},20] (* Harvey P. Dale, Sep 16 2018 *)

PARI
```
a(n)=7^n+n^7
```

A055652 Table T(m,k)=m^k+k^m (with 0^0 taken to be 1) as square array read by antidiagonals.

Original entry on oeis.org

2, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 8, 4, 1, 1, 5, 17, 17, 5, 1, 1, 6, 32, 54, 32, 6, 1, 1, 7, 57, 145, 145, 57, 7, 1, 1, 8, 100, 368, 512, 368, 100, 8, 1, 1, 9, 177, 945, 1649, 1649, 945, 177, 9, 1, 1, 10, 320, 2530, 5392, 6250, 5392, 2530, 320, 10, 1, 1, 11, 593, 7073

Offset: 0

Henry Bottomley, Jun 08 2000

Columns and rows are A000012 (apart from first term), A000027, A001580, A001585, A001589, A001593 etc. Diagonals include A013499 (apart from first two terms), A051442, A051489.
Cf. A055651.
Contribution from Franklin T. Adams-Watters, Oct 26 2009: (Start)
Rows/columns: A000027, A001580, A001585, A001589, A001593, A001594, A001596.
Main diagonal is 2 * A000312. More diagonals: A051442, A051489, A155539.
Cf. A076980, A156353, A156354. (End)

E.g.f. Sum(n,m, T(n,m)/(n! m!)) = e^(x e^y) + e^(y e^x). [From Franklin T. Adams-Watters, Oct 26 2009]

A185277 a(n) = n^9 + 9^n.

Original entry on oeis.org

1, 10, 593, 20412, 268705, 2012174, 10609137, 45136576, 177264449, 774840978, 4486784401, 33739007300, 287589316833, 2552470327702, 22897453501745, 205929575454024, 1853088908328577, 16677300287543066, 150094833656289489

Offset: 0

Vladimir Joseph Stephan Orlovsky, Feb 19 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (19,-135,525,-1290,2142,-2478,2010,-1125,415,-91,9).

Cf. sequences of the form k^n+n^k: A001580 (k=2), A001585 (k=3), A001589 (k=4), A001593 (k=5), A001594 (k=6), A001596 (k=7), A198401 (k=8), this sequence (k=9), A177068 (k=10), A177069 (k=11).

[9^n+n^9: n in [0..30]]; // Vincenzo Librandi, Oct 27 2011

Table[9^n + n^9, {n, 0, 30}] (* or *) CoefficientList[Series[(1 - 9 x + 538 x^2 + 9970 x^3 - 43028 x^4 - 638168 x^5 - 1317266 x^6 - 779618 x^7 - 130925 x^8 - 4527 x^9 - 8 x^10)/((1 - x)^10 (1 - 9 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Aug 28 2014 *)
LinearRecurrence[{19,-135,525,-1290,2142,-2478,2010,-1125,415,-91,9},{1,10,593,20412,268705,2012174,10609137,45136576,177264449,774840978,4486784401},20] (* Harvey P. Dale, Jun 08 2023 *)

for(n=0,25, print1(n^9 + 9^n, ", ")) \\ G. C. Greubel, Jun 25 2017

[9^n+n^9 for n in (0..30)] # Bruno Berselli, Aug 28 2014

G.f.: (1 - 9*x + 538*x^2 + 9970*x^3 - 43028*x^4 - 638168*x^5-1317266*x^6 - 779618*x^7 - 130925*x^8 - 4527*x^9 - 8*x^10)/((1-x)^10*(1-9*x)). - Vincenzo Librandi, Aug 28 2014

A192760 Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.

Original entry on oeis.org

0, 1, 4, 9, 18, 33, 58, 99, 166, 275, 452, 739, 1204, 1957, 3176, 5149, 8342, 13509, 21870, 35399, 57290, 92711, 150024, 242759, 392808, 635593, 1028428, 1664049, 2692506, 4356585, 7049122, 11405739, 18454894, 29860667, 48315596, 78176299

Offset: 0

Clark Kimberling, Jul 09 2011

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

Form an array with m(1,j) = m(j,1) = j for j >= 1 in the top row and left column, and internal terms m(i,j) = m(i-1,j-1) + m(i-1,j). The sum of the terms in the n-th antidiagonal is a(n). - J. M. Bergot, Nov 07 2012

Index entries for linear recurrences with constant coefficients, signature (3,-2,-1,1).

Cf. A192744, A192232.

q = x^2; s = x + 1; z = 40;
p[0, n_] := 1; p[n_, x_] := x*p[n - 1, x] + n + 2;
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}]  (* A001594 *)
u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}]  (* A192760 *)

a(n) = 2*A000045(n+3)-n-4. G.f. x*(-1-x+x^2) / ( (x^2+x-1)*(x-1)^2 ). - R. J. Mathar, Nov 09 2012

a(n) = Sum_{1..n} C(n-i+2,i+1) + C(n-i,i). - Wesley Ivan Hurt, Sep 13 2017

A177069 11^n + n^11.

Original entry on oeis.org

1, 12, 2169, 178478, 4208945, 48989176, 364568617, 1996813914, 8804293473, 33739007300, 125937424601, 570623341222, 3881436747409, 36314872537968, 383799398752905, 4185897925275026, 45967322049616577, 505481300395601404

Offset: 0

Vincenzo Librandi, May 31 2010

Vincenzo Librandi, Table of n, a(n) for n = 0..950
Index entries for linear recurrences with constant coefficients, signature (23,-198,946,-2915,6237,-9636,10956,-9207,5665,-2486,738,-133,11).

Cf. sequences of the form k^n+n^k: A001580 (k=2), A001585 (k=3), A001589 (k=4), A001593 (k=5), A001594 (k=6), A001596 (k=7), A198401 (k=8), A185277 (k=9), A177068 (k=10), this sequence (k=11).

Magma
```
[11^n+n^11: n in [0..20]]
```

Table[11^n + n^11, {n, 0, 30}] (* or *) CoefficientList[Series[(1 - 11 x + 2091 x^2 + 130021 x^3 + 524976 x^4 -14501046 x^5 - 91394082 x^6 - 163229406 x^7 - 104915271 x^8 - 24085951 x^9 - 1676905 x^10 - 22407 x^11 - 10 x^12)/((1 - x)^12 (1 - 11 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Aug 28 2014 *)

a(n)= 11^n+n^11 \\ Charles R Greathouse IV, Jan 11 2012

[11^n+n^11 for n in (0..30)] # Bruno Berselli, Aug 28 2014

G.f.: (1 - 11*x + 2091*x^2 + 130021*x^3 + 524976*x^4 - 14501046*x^5 - 91394082*x^6 - 163229406*x^7 - 104915271*x^8 - 24085951*x^9 - 1676905*x^10 - 22407*x^11 - 10*x^12) / ((1-x)^12*(1-11*x)). - Vincenzo Librandi, Aug 28 2014

A198401 a(n) = 8^n + n^8.

Original entry on oeis.org

1, 9, 320, 7073, 69632, 423393, 1941760, 7861953, 33554432, 177264449, 1173741824, 8804293473, 69149458432, 550571544609, 4399522300160, 35186934979457, 281479271677952, 2251806789442689, 18014409529442560, 144115205059418913

Offset: 0

Vincenzo Librandi, Oct 27 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (17,-108,372,-798,1134,-1092,708,-297,73,-8).

Cf. A001580, A001585, A001589, A001593, A001594, A001596, A177068, A177069, A185277.

Magma
```
[8^n+n^8: n in [0..20]]
```

f[n_] := 8^n + n^8; f[Range[0, 30]]
LinearRecurrence[{17,-108,372,-798,1134,-1092,708,-297,73,-8},{1,9,320,7073,69632,423393,1941760,7861953,33554432,177264449},30] (* Harvey P. Dale, Aug 26 2023 *)

a(n)=8^n+n^8 \\ Charles R Greathouse IV, Oct 16 2015

G.f.: -(9*x^9 +1966*x^8 +34133*x^7 +120575*x^6 +109459*x^5 +18599*x^4 -2233*x^3 -275*x^2 +8*x -1) / ((x -1)^9*(8*x -1)). - Colin Barker, Sep 13 2013

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A001596 a(n) = 7^n + n^7.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

A055652 Table T(m,k)=m^k+k^m (with 0^0 taken to be 1) as square array read by antidiagonals.

Views

Author

Keywords

Crossrefs

Formula

A185277 a(n) = n^9 + 9^n.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A192760 Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A177069 11^n + n^11.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A198401 a(n) = 8^n + n^8.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula