A093375 -id:A093375 - cp's OEIS frontend

A128229 A natural number transform, inverse of signed A094587.

1, 1, 1, 0, 2, 1, 0, 0, 3, 1, 0, 0, 0, 4, 1, 0, 0, 0, 0, 5, 1, 0, 0, 0, 0, 0, 6, 1, 0, 0, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 0, 0, 0, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 1

Offset: 1

Gary W. Adamson, Feb 19 2007

Signed version of the transform (with -1, -2, -3, ... in the subdiagonal) gives A094587 having row sums A000522: (1, 2, 5, 16, 65, 236, ...). Unsigned inverse gives signed A094587 (with alternate signs); giving row sums = a signed variation of A094587 as follows: (1, 0, 1, -2, 9, -44, 265, -1854, ...). Binomial transform of the triangle = A093375.

Eigensequence of the triangle = A000085 starting (1, 2, 4, 10, 26, 76, ...). - Gary W. Adamson, Dec 29 2008

			First few rows of the triangle are:
1;
1, 1;
0, 2, 1;
0, 0, 3, 1;
0, 0, 0, 4, 1;
0, 0, 0, 0, 5, 1;
0, 0, 0, 0, 0, 6, 1;
0, 0, 0, 0, 0, 0, 7, 1;
...

Cf. A094587, A000522, A094587, A093375, A128228, A128227.

Cf. A000085. - Gary W. Adamson, Dec 29 2008

a128229[n_] := Table[Which[r==q, 1, r-1==q, q, True, 0], {r, 1, n}, {q, 1, r}]
Flatten[a128229[13]] (* data *)
TableForm[a128229[8]] (* triangle *)
(* Hartmut F. W. Hoft, Jun 10 2017 *)

def T(n, k): return 1 if n==k else n - 1 if k==n - 1 else 0
for n in range(1, 11): print([T(n, k) for k in range(1, n + 1)]) # Indranil Ghosh, Jun 10 2017

Infinite lower triangular matrix with (1,1,1,...) in the main diagonal and (1,2,3,...) in the subdiagonal.

T(n,n)=1, T(n,n-1)=n-1 and T(n,k)=0 for 1<=k<=n, 1<=n. - Hartmut F. W. Hoft, Jun 10 2017

A154286 a(n) = E(k)C(n+k,k) = Euler(k)binomial(n+k,k) for k=4.

Original entry on oeis.org

5, 25, 75, 175, 350, 630, 1050, 1650, 2475, 3575, 5005, 6825, 9100, 11900, 15300, 19380, 24225, 29925, 36575, 44275, 53130, 63250, 74750, 87750, 102375, 118755, 137025, 157325, 179800, 204600, 231880, 261800, 294525, 330225, 369075, 411255

Offset: 0

Peter Luschny, Jan 06 2009

a(n) = E(4)*binomial(n+4,4) where E(n) are the Euler number in the enumeration A122045.
a(n) is the special case k=4 in the sequence of diagonals in the triangle A153641.
a(n) is the 5th row in A093375.
a(n) is the 5th column in A103406.
a(n) is the 5th antidiagonal in A103283.
(a(n+1) - a(n))/5 are the pyramidal numbers A000292 (n>1).
(a(n+2) - 2a(n+1) + a(n))/5 are the triangular numbers A000217 (n>2).
(a(n+3) - 3a(n+2) + 3a(n+1) - a(n))/5 are the natural numbers A000027 (n > 3).
Number of orbits of Aut(Z^7) as function of the infinity norm (n+4) of the representative integer lattice point of the orbit, when the cardinality of the orbit is equal to 107520. - Philippe A.J.G. Chevalier, Dec 28 2015

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000217, A153641, A000579.

[(n+1)*(n+2)*(n+3)*(n+4)*5 div 24: n in [0..40]]; // Vincenzo Librandi, Sep 10 2016

Maple
```
seq(euler(4)*binomial(n+4,4),n=0..32);
```

CoefficientList[Series[-5/(x - 1)^5, {x, 0, 35}], x] (* Robert G. Wilson v, Jan 29 2015 *)
Table[(n + 1)*(n + 2)*(n + 3)*(n + 4)*5/24, {n, 0, 25}] (* G. C. Greubel, Sep 09 2016 *)
LinearRecurrence[{5,-10,10,-5,1},{5,25,75,175,350},40] (* Harvey P. Dale, Nov 18 2021 *)

x='x+O('x^99); Vec(5/(1-x)^5) \\ Altug Alkan, Sep 10 2016

a(n) = (n+1)*(n+2)*(n+3)*(n+4)*5/24.
a(n) = a(n-1)*(n+4)/n (n>0), a(0)=5.
O.g.f.: 5/(1-x)^5.
E.g.f.: (5/24)*x*(24 + 36*x + 12*x^2 + x^3)*exp(x). - G. C. Greubel, Sep 09 2016
a(n) = 5*A000332(n+4). - Michel Marcus, Sep 10 2016

A073107 Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).

Original entry on oeis.org

1, 2, 1, 5, 4, 1, 16, 15, 6, 1, 65, 64, 30, 8, 1, 326, 325, 160, 50, 10, 1, 1957, 1956, 975, 320, 75, 12, 1, 13700, 13699, 6846, 2275, 560, 105, 14, 1, 109601, 109600, 54796, 18256, 4550, 896, 140, 16, 1, 986410, 986409, 493200, 164388, 41076, 8190, 1344, 180, 18, 1

Offset: 0

Vladeta Jovovic, Aug 19 2002

Triangle is second binomial transform of A008290. - Paul Barry, May 25 2006

Ignoring signs, n-th row is the coefficient list of the permanental polynomial of the n X n matrix with 2's along the main diagonal and 1's everywhere else (see Mathematica code below). - John M. Campbell, Jul 02 2012

			exp((1 + y)*x)/(1 - x) =
  1 +
  1/1! * (2 + y) * x +
  1/2! * (5 + 4*y + y^2) * x^2 +
  1/3! * (16 + 15*y + 6*y^2 + y^3) * x^3 +
  1/4! * (65 + 64*y + 30*y^2 + 8*y^3 + y^4) * x^4 +
  1/5! * (326 + 325*y + 160*y^2 + 50*y^3 + 10*y^4 + y^5) * x^5 + ...
Triangle starts:
  [0]     1;
  [1]     2,     1;
  [2]     5,     4,    1;
  [3]    16,    15,    6,    1;
  [4]    65,    64,   30,    8,   1;
  [5]   326,   325,  160,   50,  10,   1;
  [6]  1957,  1956,  975,  320,  75,  12,  1;
  [7] 13700, 13699, 6846, 2275, 560, 105, 14, 1;

Seiichi Manyama, Rows n = 0..139, flattened
Wikipedia, Sheffer sequence.

Cf. A008290, A008291, A046802, A093375 (unsigned inverse), A094587, A010842 (row sums), A000142 (alternating row sums), A367963 (central terms).

Column k=0..4 give A000522, A007526, A038155, A357479, A357480.

T := (n, k) -> binomial(n,k)*KummerU(k-n, k-n, 1);
seq(seq(simplify(T(n, k)), k = 0..n), n=0..8);  # Peter Luschny, Oct 16 2024

perm[m_List] := With[{v=Array[x,Length[m]]},Coefficient[Times@@(m.v),Times@@v]] ;
A[q_] := Array[KroneckerDelta[#1,#2] + 1&,{q,q}] ;
n = 1 ; Print[{1}]; While[n < 10, Print[Abs[CoefficientList[perm[A[n] - IdentityMatrix[n] * k], k]]]; n++] (* John M. Campbell, Jul 02 2012 *)
A073107[n_, k_] := If[n == k, 1, Floor[E*(n - k)!]*Binomial[n, k]];
Table[A073107[n, k], {n, 0, 10}, {k, 0, n}] (* Paolo Xausa, Oct 16 2024 *)

def T(n, k):
    return sum(binomial(j,k) * factorial(n) // factorial(j) for j in range(n+1))
for n in range(8): print([T(n, k) for k in range(n+1)])
# Peter Luschny, Oct 16 2024

O.g.f. for k-th column is (1/k!)*Sum_{i >= k} i!*x^i/(1-x)^(i+1).
For n > 0, T(n, 0) = floor(n!*exp(1)) = A000522(n), T(n, 1) = floor(n!*exp(1) - 1) = A007526(n), T(n, 2) = 1/2!*floor(n!*exp(1) - 1 - n) = A038155(n), T(n, 3) = 1/3!*floor(n!*exp(1) - 1 - n - n*(n - 1)), T(n, 4) = 1/4!*floor(n!*exp(1) - 1 - n - n*(n - 1) - n*(n - 1)*(n - 2)), ... .
Row sums give A010842.
E.g.f. for k-th column is (x^k/k!)*exp(x)/(1 - x).
O.g.f. for k-th row is n!*Sum_{k = 0..n} (1 + x)^k/k!.
T(n,k) = Sum_{j = 0..n} binomial(j,k)*n!/j!. - Paul Barry, May 25 2006
-exp(-x) * Sum_{k=0..n} T(n,k)*x^k = Integral (x+1)^n*exp(-x) dx = -exp(1)*Gamma(n+1,x+1). - Gerald McGarvey, Mar 15 2009
From Peter Bala, Sep 20 2012: (Start)
Exponential Riordan array [exp(x)/(1-x),x] belonging to the Appell subgroup, which factorizes in the Appell group as [1/1-x,x]*[exp(x),x] = A094587*A007318.
The n-th row polynomial R(n,x) of the triangle satisfies d/dx(R(n,x)) = n*R(n-1,x), as well as R(n,x + y) = Sum {k = 0..n} binomial(n,k)*R(k,x)*y^(n-k). The row polynomials are a Sheffer sequence of Appell type.
Matrix inverse of triangle is a signed version of A093375. (End)
From Tom Copeland, Oct 20 2015: (Start)
The raising operator, with D = d/dx, for the row polynomials is RP = x + d{log[e^D/(1-D)]}/dD = x + 1 + 1/(1-D) =  x + 2 + D + D^2 + ..., i.e., RP R(n,x) = R(n+1,x).
This operator is the limit as t tends to 1 of the raising operator of the polynomials p(n,x;t) described in A046802, implying R(n,x) = p(n,x;1). Compare with the raising operator of A094587, x + 1/(1-D), and that of signed A093375, x - 1 - 1/(1-D).
From the Appell formalism, the row polynomials RI(n,x) of signed A093375 are the umbral inverse of this entry's row polynomials; that is, R(n,RI(.,x)) = x^n = RI(n,R(.,x)) under umbral composition. (End)
From Werner Schulte, Sep 07 2020: (Start)
T(n,k) = (n! / k!) * (Sum_{i=k..n} 1 / (n-i)!) for 0 <= k <= n.
T(n,k) = n * T(n-1,k) + binomial(n,k) for 0 <= k <= n with initial values T(0,0) = 1 and T(i,j) = 0 if j < 0 or j > i.
T(n,k) = A000522(n-k) * binomial(n,k) for 0 <= k <= n. (End)

More terms from Emeric Deutsch, Feb 23 2004

A103406 Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1's elsewhere.

Original entry on oeis.org

1, 1, 2, 1, 4, 3, 1, 6, 9, 4, 1, 8, 18, 16, 5, 1, 10, 30, 40, 25, 6, 1, 12, 45, 80, 75, 36, 7, 1, 14, 63, 140, 175, 126, 49, 8, 1, 16, 84, 224, 350, 336, 196, 64, 9, 1, 18, 108, 336, 630, 756, 588, 288, 81, 10, 1, 20, 135, 480, 1050, 1512, 1470, 960, 405, 100, 11, 1, 22, 165

Offset: 0

Gary W. Adamson, Feb 04 2005

This triangle * [1/1, 1/2, 1/3, ...] = (1, 2, 4, 8, 16, 32, ...). - Gary W. Adamson, Nov 15 2007

Triangle read by rows: T(n,k) = (k+1)*binomial(n,k), 0 <= k <= n. - Philippe Deléham, Apr 20 2009

			Characteristic polynomial of 3 X 3 matrix [2 1 1 / 1 2 1 / 1 1 2] = x^3 - 6x^2 + 9x - 4.
The first few characteristic polynomials are:
  1
  x - 2
  x^2 - 4x + 3
  x^3 - 6x^2 + 9x - 4
  x^4 - 8x^3 + 18x^2 - 16x + 5

Vincenzo Librandi, Rows n = 0..100, flattened

Row sums = A001792: 1, 3, 8, 20, 48, 112, ...
See A103283 for the mirror image.
Cf. A093375, A127648, A128064.

with(linalg): printf(`%d,`,1): for n from 1 to 15 do mymat:=array(1..n, 1..n): for i from 1 to n do for j from 1 to n do if i=j then mymat[i,j]:=2 else mymat[i,j]:=1 fi: od: od: temp:=charpoly(mymat,x): for j from n to 0 by -1 do printf(`%d,`,abs(coeff(temp, x, j))) od: od: # James Sellers, Apr 22 2005
p := (n,x) -> (x+1)^(n-1)+(x+1)^(n-2)*(n-1);
seq(seq(coeff(p(n,x),x,n-j-1),j=0..n-1),n=1..11); # Peter Luschny, Feb 25 2014

t[n_, k_] := (k+1)*Binomial[n, k]; Table[t[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Oct 09 2012, after Philippe Deléham *)

Binomial transform of A127648. - Gary W. Adamson, Nov 15 2007
Equals A128064 * A007318. - Gary W. Adamson, Jan 03 2008
T(n,k) = (k+1)*A007318(n,k). - Philippe Deléham, Apr 20 2009
T(n,k) = Sum_{i=1..k+1} i*binomial(k+1,i)*binomial(n-k,k+1-i). - Mircea Merca, Apr 11 2012
O.g.f.: (1 - y)/(1 - y - x*y)^2 = 1 + (1 + 2*x)*y + (1 + 4*x + 3*x*2)*y^2 + .... - Peter Bala, Oct 18 2023

More terms from James Sellers, Apr 22 2005

A059298 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.

Original entry on oeis.org

1, 2, 1, 3, 6, 1, 4, 24, 12, 1, 5, 80, 90, 20, 1, 6, 240, 540, 240, 30, 1, 7, 672, 2835, 2240, 525, 42, 1, 8, 1792, 13608, 17920, 7000, 1008, 56, 1, 9, 4608, 61236, 129024, 78750, 18144, 1764, 72, 1, 10, 11520, 262440, 860160, 787500, 272160, 41160

Offset: 0

N. J. A. Sloane, Jan 25 2001

The inverse triangle is the signed version 1,-2,1,9,-6,1,.. of triangle A061356. - Peter Luschny, Mar 13 2009
T(n,k) is the sum of the products of the cardinality of the blocks (cells) in the set partitions of {1,2,..,n} into exactly k blocks.
From Peter Bala, Jul 22 2014: (Start)
Exponential Riordan array [(1+x)*exp(x), x*exp(x)].
Let M = A093375, the exponential Riordan array [(1+x)*exp(x), x], and for k = 0,1,2,... define M(k) to be the lower unit triangular block array
  /I_k 0\
  \ 0  M/
having the k x k identity matrix I_k as the upper left block; in particular, M(0) = M. The present triangle equals the infinite matrix product M(0)*M(1)*M(2)*... - see the Example section. (End)
The Bell transform of n+1. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 18 2016

			Triangle begins
1;
2, 1;
3, 6, 1;
4, 24, 12, 1; ...
From _Peter Bala_, Jul 22 2014: (Start)
With the arrays M(k) as defined in the Comments section, the infinite product M(0)*M(1)*M(2)*... begins
/1          \/1        \/1        \      /1           \
|2  1       ||0 1      ||0 1      |      |2  1        |
|3  4  1    ||0 2 1    ||0 0 1    |... = |3  6  1     |
|4  9  6 1  ||0 3 4 1  ||0 0 2 1  |      |4 24 12  1  |
|5 16 18 8 1||0 4 9 6 1||0 0 3 4 1|      |5 80 90 20 1|
|...        ||...      ||...      |      |...         | (End)

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 91, #43 and p. 135, [3i'].

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Eric Weisstein's World of Mathematics, Idempotent Number

There are 4 versions: A059297, A059298, A059299, A059300.
Diagonals give A001788, A036216, A040075, A050982, A002378, 3*A002417, etc.
Row sums are A000248. A093375.

/* As triangle */ [[Binomial(n,k)*k^(n-k): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Aug 22 2015

T:= (n, k)-> binomial(n+1,k+1)*(k+1)^(n-k): seq(seq(T(n, k), k=0..n), n=0..10); # Georg Fischer, Oct 27 2021

t = Transpose[ Table[ Range[0, 11]! CoefficientList[ Series[(x Exp[x])^n/n!, {x, 0, 11}], x], {n, 11}]]; Table[ t[[n, k]], {n, 2, 11}, {k, n - 1}] // Flatten (* or simply *)
t[n_, k_] := Binomial[n, k]*k^(n - k); Table[t[n, k], {n, 10}, {k, n}] // Flatten

for(n=1, 25, for(k=1, n, print1(binomial(n,k)*k^(n-k), ", "))) \\ G. C. Greubel, Jan 05 2017

# uses[bell_matrix from A264428]
# Adds a column 1,0,0,0, ... at the left side of the triangle.
bell_matrix(lambda n: n+1, 10) # Peter Luschny, Jan 18 2016

A103283 Triangle read by rows: T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the n X n matrix with 2's on the diagonal and 1's elsewhere (n >= 1 and 0 <= k <= n). Row 0 consists of the single term 1.

Original entry on oeis.org

1, -2, 1, 3, -4, 1, -4, 9, -6, 1, 5, -16, 18, -8, 1, -6, 25, -40, 30, -10, 1, 7, -36, 75, -80, 45, -12, 1, -8, 49, -126, 175, -140, 63, -14, 1, 9, -64, 196, -336, 350, -224, 84, -16, 1, -10, 81, -288, 588, -756, 630, -336, 108, -18, 1, 11, -100, 405, -960, 1470, -1512, 1050, -480, 135, -20, 1, -12, 121, -550, 1485, -2640, 3234, -2772, 1650, -660, 165, -22, 1

Offset: 0

Gary W. Adamson, Feb 04 2005

			The monic characteristic polynomial of the matrix [2 1 1 / 1 2 1 / 1 1 2] is x^3 - 6*x^2 + 9*x - 4; so T(3,0) = -4, T(3,1) = 9, T(3,2) = -6, T(3,3) = 1.
Triangle T(n,k) (with rows n >= 0 and columns k >= 0) begins as follows:
   1;
  -2,   1;
   3,  -4,  1;
  -4,   9, -6,  1;
   5, -16, 18, -8, 1;
   ...

Row sums yield the sequence 1, -1, 0, 0, 0, ... . Row sums of the unsigned triangle yield A001792. See A093375 for the unsigned version. A103406 is a mirror image.

with(linalg): a:=proc(i,j) if i=j then 2 else 1 fi end: 1;for n from 1 to 11 do seq(coeff(expand(x*charpoly(matrix(n,n,a),x)),x^k),k=1..n+1) od; # yields the sequence in triangular form

M[n_] := IdentityMatrix[n] + 1;
row[n_] := row[n] = If[n == 0, {1}, If[OddQ[n], -1, 1]* CharacteristicPolynomial[M[n], x] // CoefficientList[#, x]&];
T[n_, k_] := row[n][[k + 1]];
Table[T[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Sep 30 2024 *)

O.g.f.: (1 - x*y)/(1 - x*y + y)^2 = 1 + (-2 + x)*y + (3 - 4*x + y^2)*y^2 + .... - Peter Bala, Oct 18 2023

Edited by Emeric Deutsch, Mar 19 2005

cp's OEIS Frontend

A128229 A natural number transform, inverse of signed A094587.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

A154286 a(n) = E(k)*C(n+k,k) = Euler(k)*binomial(n+k,k) for k=4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A073107 Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

SageMath

Formula

Extensions

A103406 Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1's elsewhere.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A059298 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

A103283 Triangle read by rows: T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the n X n matrix with 2's on the diagonal and 1's elsewhere (n >= 1 and 0 <= k <= n). Row 0 consists of the single term 1.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A154286 a(n) = E(k)C(n+k,k) = Euler(k)binomial(n+k,k) for k=4.