A050982 -id:A050982 - cp's OEIS frontend

A059297 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 1.

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

Offset: 0

N. J. A. Sloane, Jan 25 2001

T(n,k) = C(n,k)*k^(n-k) is the number of functions f from domain [n] to codomain [n+1] such that f(x)=n+1 for exactly k elements x of [n] and f(f(x))=n+1 for the remaining n-k elements x of [n]. Subsequently, row sums of T(n,k) provide the number of functions f:[n]->[n+1] such that either f(x)=n+1 or f(f(x))=n+1 for every x in [n]. We note that there are C(n,k) ways to choose the k elements mapped to n+1 and there are k^(n-k) ways to map n-k elements to a set of k elements. - Dennis P. Walsh, Sep 05 2012
Conjecture: the matrix inverse is A137452. - R. J. Mathar, Mar 12 2013
The above conjecture is correct. This triangle is the exponential Riordan array [1, x*exp(x)]. Thus the  inverse array is the exponential Riordan array [ 1, W(x)], which equals A137452. - Peter Bala, Apr 08 2013

			Triangle begins:
1;
0,  1;
0,  2,   1;
0,  3,   6,    1;
0,  4,  24,   12,    1;
0,  5,  80,   90,   20,   1;
0,  6, 240,  540,  240,  30,  1;
0,  7, 672, 2835, 2240, 525, 42,  1;
Row 4. Expansion of x^4 in terms of Abel polynomials:
x^4 = -4*x+24*x*(x+2)-12*x*(x+3)^2+x*(x+4)^3.
O.g.f. for column 2: A(-2,1/x) = x^2/(1-2*x)^3 = x^2+6*x^3+24*x^4+80*x^5+....

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

Alois P. Heinz, Rows n = 0..140, flattened
Peter Bala, Diagonals of triangles with generating function exp(t*F(x)).
G. Duchamp, K. A. Penson, A. I. Solomon, A. Horzela and P. Blasiak, One-parameter groups and combinatorial physics, arXiv:quant-ph/0401126, 2004.
Emanuele Munarini, Combinatorial identities involving the central coefficients of a Sheffer matrix, Applicable Analysis and Discrete Mathematics (2019) Vol. 13, 495-517.
Bruce E. Sagan, A note on Abel polynomials and rooted labeled forests. Discrete Mathematics 44(3): 293-298 (1983).
J. Taylor, Formal group laws and hypergraph colorings, doctoral thesis, Univ. of Wash., 2016, p. 96, [_Tom Copeland_, Dec 20 2018].
Eric Weisstein's World of Mathematics, Abel Polynomial
Eric Weisstein's World of Mathematics, Idempotent Number
Jian Zhou, On Some Mathematics Related to the Interpolating Statistics, arXiv:2108.10514 [math-ph], 2021.

There are 4 versions: A059297, A059298, A059299, A059300.
Diagonals give A001788, A036216, A040075, A050982, A002378, 3*A002417, etc.
Row sums are A000248.
Cf. A061356, A202017, A137452 (inverse array), A264428.

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

T:= (n, k)-> binomial(n, k) *k^(n-k):
seq(seq(T(n, k), k=0..n), n=0..12);  # Alois P. Heinz, Sep 05 2012

nn=10;f[list_]:=Select[list,#>0&];Prepend[Map[Prepend[#,0]&,Rest[Map[f,Range[0,nn]!CoefficientList[Series[Exp[y x Exp[x]],{x,0,nn}],{x,y}]]]],{1}]//Grid  (* Geoffrey Critzer, Feb 09 2013 *)
t[n_, k_] := Binomial[n, k]*k^(n - k); Prepend[Flatten@Table[t[n, k], {n, 10}, {k, 0, n}], 1] (* Arkadiusz Wesolowski, Mar 23 2013 *)

# uses[bell_transform from A264428]
def A059297_row(n):
    nat = [k for k in (1..n)]
    return bell_transform(n, nat)
[A059297_row(n)  for n in range(8)] # Peter Luschny, Dec 20 2015

E.g.f.: exp(x*y*exp(y)). - Vladeta Jovovic, Nov 18 2003
Up to signs, this is the triangle of connection constants expressing the monomials x^n as a linear combination of the Abel polynomials A(k,x) := x*(x+k)^(k-1), 0 <= k <= n. O.g.f. for the k-th column: A(-k,1/x) = x^k/(1-k*x)^(k+1). Cf. A061356. Examples are given below. - Peter Bala, Oct 09 2011
The o.g.f.'s for the diagonals of this triangle are the rational functions occurring in the expansion of the compositional inverse (with respect to x) (x-t*x*exp(x))^-1 = x/(1-t) + 2*t/(1-t)^3*x^2/2! + (3*t+9*t^2)/(1-t)^5*x^3/3! + (4*t+52*t^2+64*t^3)/(1-t)^7*x^4/4! + .... For example, the o.g.f. for second subdiagonal is (3*t+9*t^2)/(1-t)^5 = 3*t + 24*t^2 + 90*t^3 + 240*t^4 + .... See the Bala link. The coefficients of the numerator polynomials are listed in A202017. - Peter Bala, Dec 08 2011
Recurrence equation: T(n+1,k+1) = Sum_{j=0..n-k} (j+1)*binomial(n,j)*T(n-j,k). - Peter Bala, Jan 13 2015
The Bell transform of [1,2,3,...]. See A264428 for the Bell transform. - Peter Luschny, Dec 20 2015

A050988 6-idempotent numbers.

Original entry on oeis.org

1, 42, 1008, 18144, 272160, 3592512, 43110144, 480370176, 5043886848, 50438868480, 484213137408, 4489976365056, 40409787285504, 354362750042112, 3037395000360960, 25514118003032064, 210491473525014528, 1708695490967764992, 13669563927742119936, 107917609955858841600

Offset: 6

Eric W. Weisstein

Number of n-permutations of 7 objects: s, t, u, v, z, x, y with repetition allowed, containing exactly six u's. - Zerinvary Lajos, Jun 16 2008

Vincenzo Librandi, Table of n, a(n) for n = 6..400
Eric Weisstein's World of Mathematics, Idempotent Number.

Cf. A000027, A001788, A036216, A040075, A050982, A050989.

seq(binomial(n, 6)*6^(n-6), n=6..32); # Zerinvary Lajos, Jun 16 2008
A050988:=x^6/(1-6*x)^7; series(A050988,x,32); # Zerinvary Lajos, Aug 09 2008

a[n_] := Binomial[n, 6]*6^(n - 6); Array[a, 20, 6] (* Amiram Eldar, Apr 17 2022 *)

a(n) = binomial(n,6)*6^(n-6).
G.f.: x^6/(1-6*x)^7. - Zerinvary Lajos, Aug 09 2008
From Amiram Eldar, Apr 17 2022: (Start)
Sum_{n>=6} 1/a(n) = 102561/5 - 112500*log(6/5).
Sum_{n>=6} (-1)^n/a(n) = 605052*log(7/6) - 466341/5. (End)

A038243 Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).

Original entry on oeis.org

1, 5, 1, 25, 10, 1, 125, 75, 15, 1, 625, 500, 150, 20, 1, 3125, 3125, 1250, 250, 25, 1, 15625, 18750, 9375, 2500, 375, 30, 1, 78125, 109375, 65625, 21875, 4375, 525, 35, 1, 390625, 625000, 437500, 175000, 43750, 7000, 700, 40, 1, 1953125, 3515625, 2812500, 1312500, 393750, 78750, 10500, 900, 45, 1

Offset: 0

N. J. A. Sloane

Mirror image of A013612. - Zerinvary Lajos, Nov 25 2007
T(i,j) is the number of i-permutations of 6 objects a,b,c,d,e,f, with repetition allowed, containing j a's. - Zerinvary Lajos, Dec 21 2007
Triangle of coefficients in expansion of (5+x)^n - N-E. Fahssi, Apr 13 2008
Also the convolution triangle of A000351. - Peter Luschny, Oct 09 2022

			Triangle begins as:
       1;
       5,      1;
      25,     10,      1;
     125,     75,     15,      1;
     625,    500,    150,     20,     1;
    3125,   3125,   1250,    250,    25,    1;
   15625,  18750,   9375,   2500,   375,   30,   1;
   78125, 109375,  65625,  21875,  4375,  525,  35,  1;
  390625, 625000, 437500, 175000, 43750, 7000, 700, 40, 1;

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
B. N. Cyvin, J. Brunvoll, and S. J. Cyvin, Isomer enumeration of unbranched catacondensed polygonal systems with pentagons and heptagons, Match, No. 34 (Oct 1996), 109-121.

Cf. A000351, A000400 (row sums), A036071, A050982, A053464, A081135, A081143.

Sequences of the form q^(n-k)*binomial(n, k): A007318 (q=1), A038207 (q=2), A027465 (q=3), A038231 (q=4), this sequence (q=5), A038255 (q=6), A027466 (q=7), A038279 (q=8), A038291 (q=9), A038303 (q=10), A038315 (q=11), A038327 (q=12), A133371 (q=13), A147716 (q=14), A027467 (q=15).

[5^(n-k)*Binomial(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, May 12 2021

for i from 0 to 8 do seq(binomial(i, j)*5^(i-j), j = 0 .. i) od; # Zerinvary Lajos, Dec 21 2007
# Uses function PMatrix from A357368. Adds column 1, 0, 0, ... to the left.
PMatrix(10, n -> 5^(n-1)); # Peter Luschny, Oct 09 2022

With[{q=5}, Table[q^(n-k)*Binomial[n,k], {n,0,12}, {k,0,n}]//Flatten] (* G. C. Greubel, May 12 2021 *)

flatten([[5^(n-k)*binomial(n,k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, May 12 2021

See A038207 and A027465 and replace 2 and 3 in analogous formulas with 5. - Tom Copeland, Oct 26 2012

A059300 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane, Jan 25 2001

			Triangle begins:
1;
1,  2;
1,  6,   3;
1, 12,  24,    4;
1, 20,  90,   80,    5;
1, 30, 240,  540,  240,   6;
1, 42, 525, 2240, 2835, 672, 7;
...

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
John Riordan and N. J. A. Sloane, Correspondence, 1974

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

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

t[n_, k_] := Binomial[n + 1, k]*(n - k + 1)^k; Flatten@Table[t[n, k], {n, 0, 9}, {k, 0, n}] (* Arkadiusz Wesolowski, Mar 23 2013 *)

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

T(n,k) = binomial(n+1,n-k+1)*(n-k+1)^k. - R. J. Mathar, Mar 14 2013

A141054 8-idempotent numbers: a(n) = binomial(n+8,8)*8^n.

Original entry on oeis.org

1, 72, 2880, 84480, 2027520, 42172416, 787218432, 13495173120, 215922769920, 3262832967680, 46984794734592, 649244436332544, 8656592484433920, 111869810568069120, 1406363332855726080, 17251390216363573248, 207016682596362878976, 2435490383486622105600

Offset: 0

Zerinvary Lajos, Aug 01 2008

With a different offset, number of n-permutations of 9 objects:
p, r, s, t, u, v, z, x, y with repetition allowed, containing exactly eight (8) u's. Example: a(1)=72 because we have
uuuuuuuup, uuuuuuupu, uuuuuupuu, uuuuupuuu, uuuupuuuu, uuupuuuuu, uupuuuuuu, upuuuuuuu, puuuuuuuu,
uuuuuuuur, uuuuuuuru, uuuuuuruu, uuuuuruuu, uuuuruuuu, uuuruuuuu, uuruuuuuu, uruuuuuuu, ruuuuuuuu,
uuuuuuuus, uuuuuuusu, uuuuuusuu, uuuuusuuu, uuuusuuuu, uuusuuuuu, uusuuuuuu, usuuuuuuu, suuuuuuuu,
uuuuuuuut, uuuuuuutu, uuuuuutuu, uuuuutuuu, uuuutuuuu, uuutuuuuu, uutuuuuuu, utuuuuuuu, tuuuuuuuu,
uuuuuuuuv, uuuuuuuvu, uuuuuuvuu, uuuuuvuuu, uuuuvuuuu, uuuvuuuuu, uuvuuuuuu, uvuuuuuuu, vuuuuuuuu,
uuuuuuuuz, uuuuuuuzu, uuuuuuzuu, uuuuuzuuu, uuuuzuuuu, uuuzuuuuu, uuzuuuuuu, uzuuuuuuu, zuuuuuuuu,
uuuuuuuux, uuuuuuuxu, uuuuuuxuu, uuuuuxuuu, uuuuxuuuu, uuuxuuuuu, uuxuuuuuu, uxuuuuuuu, xuuuuuuuu,
uuuuuuuuy, uuuuuuuyu, uuuuuuyuu, uuuuuyuuu, uuuuyuuuu, uuuyuuuuu, uuyuuuuuu, uyuuuuuuu, yuuuuuuuu.

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

Cf. A000027, A001788, A036216, A040075, A050982, A050988, A050989, A059297, A059300.

[8^n* Binomial(n+8, 8): n in [0..20]]; // Vincenzo Librandi, Oct 16 2011

Maple
```
seq(binomial(n+8,8)*8^n, n=0..17);
```

Table[Binomial[n + 8, 8] 8^n, {n, 0, 15}] (* Michael De Vlieger, Jul 24 2017 *)

vector(15,n,binomial(n+7,8)*8^(n-1)) \\ Derek Orr, Jul 24 2017

a(n) = binomial(n+8,8)*8^n.
G.f.: 1/(1-8*x)^9. - Vincenzo Librandi, Oct 16 2011
From Amiram Eldar, Apr 17 2022: (Start)
Sum_{n>=0} 1/a(n) = 738990736/105 - 52706752*log(8/7).
Sum_{n>=0} (-1)^n/a(n) = 306110016*log(9/8) - 1261909808/35. (End)

A050989 7-idempotent numbers.

Original entry on oeis.org

1, 56, 1764, 41160, 792330, 13311144, 201885684, 2826399576, 37096494435, 461645264080, 5493578642552, 62926446269232, 697434779483988, 7510836086750640, 78863778910881720, 809668130151718992, 8147285559651672357, 80514351413028291528, 782778416515552834300

Offset: 7

Eric W. Weisstein

Vincenzo Librandi, Table of n, a(n) for n = 7..400
Eric Weisstein's World of Mathematics, Idempotent Number.
Index entries for linear recurrences with constant coefficients, signature (56,-1372,19208,-168070,941192,-3294172,6588344,-5764801).

Cf. A001788, A036216, A040075, A050982, A050988, A059297, A059300.

[7^(n-7)* Binomial(n, 7): n in [7..30]]; // Vincenzo Librandi, Oct 16 2011

seq(binomial(n, 7)*7^(n-7), n=7..33); # Zerinvary Lajos, Aug 01 2008

LinearRecurrence[{56,-1372,19208,-168070,941192,-3294172,6588344,-5764801}, {1,56,1764,41160,792330,13311144,201885684,2826399576},20] (* Harvey P. Dale, May 31 2014 *)

a(n)=binomial(n, 7)*7^(n-7) \\ Charles R Greathouse IV, Sep 03 2011

a(n) = C(n, 7)*7^(n-7).
G.f.: x^7/(1-7*x)^8.
From Amiram Eldar, Apr 17 2022: (Start)
Sum_{n>=7} 1/a(n) = 2286144*log(7/6) - 10572289/30.
Sum_{n>=7} (-1)^(n+1)/a(n) = 12845056*log(8/7) - 51456517/30. (End)

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

A140404 a(n) = binomial(n+5, 5)*7^n.

Original entry on oeis.org

1, 42, 1029, 19208, 302526, 4235364, 54353838, 652246056, 7419298887, 80787921214, 848273172747, 8636963213424, 85649885199788, 830145041167176, 7886377891088172, 73606193650156272, 676256904160810749, 6126091955339109138, 54794489156088698401, 484498640959100070072

Offset: 0

Zerinvary Lajos, Jun 16 2008

With a different offset, number of n-permutations of 8 objects:r,s,t,u,v,z,x,y with repetition allowed, containing exactly five (5) u's. Example: a(1)=42 because we have
uuuuur, uuuuru, uuuruu, uuruuu, uruuuu, ruuuuu
uuuuus, uuuusu, uuusuu, uusuuu, usuuuu, suuuuu,
uuuuut, uuuutu, uuutuu, uutuuu, utuuuu, tuuuuu,
uuuuuv, uuuuvu, uuuvuu, uuvuuu, uvuuuu, vuuuuu,
uuuuuz, uuuuzu, uuuzuu, uuzuuu, uzuuuu, zuuuuu,
uuuuux, uuuuxu, uuuxuu, uuxuuu, uxuuuu, xuuuuu,
uuuuuy, uuuuyu, uuuyuu, uuyuuu, uyuuuu, yuuuuu.

Vincenzo Librandi, Table of n, a(n) for n = 0..400
Index entries for linear recurrences with constant coefficients, signature (42,-735,6860,-36015,100842,-117649).

Cf. A000389, A036084, A036219, A045543, A050982, A054849.

[7^n* Binomial(n+5, 5): n in [0..20]]; // Vincenzo Librandi, Oct 12 2011

Maple
```
seq(binomial(n+5,5)*7^n,n=0..17);
```

Table[Binomial[n+5,5]7^n,{n,0,20}] (* or *) LinearRecurrence[ {42,-735,6860,-36015,100842,-117649},{1,42,1029,19208,302526,4235364},21] (* Harvey P. Dale, Sep 08 2011 *)

a(n)=binomial(n+5,5)*7^n \\ Charles R Greathouse IV, Oct 07 2015

G.f.: 1/(1-7*x)^6. - Zerinvary Lajos, Aug 06 2008
a(n) = 42*a(n-1) - 735*a(n-2) + 6860*a(n-3) - 36015*a(n-4) + 100842*a(n-5) - 117649*a(n-6). - Harvey P. Dale, Sep 08 2011
From Amiram Eldar, Aug 28 2022: (Start)
Sum_{n>=0} 1/a(n) = 45360*log(7/6) - 27965/4.
Sum_{n>=0} (-1)^n/a(n) = 143360*log(8/7) - 229705/12. (End)

A059299 Triangle of idempotent numbers (version 3), T(n, k) = binomial(n, k) * (n - k)^k.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane, Jan 25 2001

			Triangle begins:
1,
1,  0,
1,  2,   0,
1,  6,   3,    0,
1, 12,  24,    4,    0,
1, 20,  90,   80,    5,   0,
1, 30, 240,  540,  240,   6, 0,
1, 42, 525, 2240, 2835, 672, 7, 0,
...

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

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

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

T := (n, k) -> binomial(n, k) * (n - k)^k:
for n from 0 to 9 do seq(T(n, k), k = 0..n) od;

t[n_, k_] := Binomial[n, k]*(n - k)^k; Prepend[Flatten@Table[t[n, k], {n, 10}, {k, 0, n}], 1] (* Arkadiusz Wesolowski, Mar 23 2013 *)

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

Name corrected by Peter Luschny, Nov 12 2023

A173113 a(n) = binomial(n + 10, 10) * 5^n.

Original entry on oeis.org

1, 55, 1650, 35750, 625625, 9384375, 125125000, 1519375000, 17092968750, 180425781250, 1804257812500, 17222460937500, 157872558593750, 1396564941406250, 11970556640625000, 99754638671875000

Offset: 0

Zerinvary Lajos, Feb 10 2010

With a different offset, number of n-permutations (n>=10) of 6 objects: t, u, v, z, x, y with repetition allowed, containing exactly ten (10) u's.

Vincenzo Librandi, Table of n, a(n) for n = 0..400
Index entries for linear recurrences with constant coefficients, signature (55,-1375,20625,-206250,1443750,-7218750,25781250,-64453125,107421875,-107421875,48828125).

Cf. A053464, A084902, A081143, A036071, A050982, A140405, A140220, A140346, A140520.

[5^n*Binomial(n+10, 10): n in [0..30]]; // Vincenzo Librandi, Oct 15 2011

Table[Binomial[n + 10, 10]*5^n, {n, 0, 20}]

a(n) = C(n + 10, 10)*5^n, n>=0.
G.f.: 1/(1-5*x)^11. - Vincenzo Librandi, Oct 15 2011
From Amiram Eldar, Sep 01 2022: (Start)
Sum_{n>=0} 1/a(n) = 184261655/63 - 13107200*log(5/4).
Sum_{n>=0} (-1)^n/a(n) = 503884800*log(6/5) - 11575501585/126. (End)

cp's OEIS Frontend

A059297 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A050988 6-idempotent numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A038243 Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A059300 Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A141054 8-idempotent numbers: a(n) = binomial(n+8,8)*8^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A050989 7-idempotent numbers.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

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