A040075 -id:A040075 - 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

A054335 A convolution triangle of numbers based on A000984 (central binomial coefficients of even order).

Original entry on oeis.org

1, 2, 1, 6, 4, 1, 20, 16, 6, 1, 70, 64, 30, 8, 1, 252, 256, 140, 48, 10, 1, 924, 1024, 630, 256, 70, 12, 1, 3432, 4096, 2772, 1280, 420, 96, 14, 1, 12870, 16384, 12012, 6144, 2310, 640, 126, 16, 1, 48620, 65536, 51480, 28672, 12012, 3840, 924, 160, 18, 1

Offset: 0

Wolfdieter Lang, Mar 13 2000

In the language of the Shapiro et al. reference (given in A053121) such a lower triangular (ordinary) convolution array, considered as a matrix, belongs to the Bell-subgroup of the Riordan-group. The g.f. for the row polynomials p(n,x) (increasing powers of x) is 1/(sqrt(1-4*z)-x*z).
The column sequences are for m=0..20: A000984, A000302 (powers of 4), A002457, A002697, A002802, A038845, A020918, A038846, A020920, A040075, A020922, A045543, A020924, A054337, A020926, A054338, A020928, A054339, A020930, A054340, A020932.
Riordan array (1/sqrt(1-4*x),x/sqrt(1-4*x)). - Paul Barry, May 06 2009
The matrix inverse is apparently given by deleting the leftmost column from A206022. - R. J. Mathar, Mar 12 2013

			Triangle begins:
    1;
    2,    1;
    6,    4,   1;
   20,   16,   6,   1;
   70,   64,  30,   8,  1;
  252,  256, 140,  48, 10,  1;
  924, 1024, 630, 256, 70, 12, 1; ...
Fourth row polynomial (n=3): p(3,x) = 20 + 16*x + 6*x^2 + x^3.
From _Paul Barry_, May 06 2009: (Start)
Production matrix begins
    2,   1;
    2,   2,  1;
    0,   2,  2,  1;
   -2,   0,  2,  2,  1;
    0,  -2,  0,  2,  2,  1;
    4,   0, -2,  0,  2,  2, 1;
    0,   4,  0, -2,  0,  2, 2, 1;
  -10,   0,  4,  0, -2,  0, 2, 2, 1;
    0, -10,  0,  4,  0, -2, 0, 2, 2, 1; (End)

G. C. Greubel, Rows n = 0..100 of triangle, flattened
Paul Barry, Embedding structures associated with Riordan arrays and moment matrices, arXiv preprint arXiv:1312.0583 [math.CO], 2013.
Milan Janjić, Pascal Matrices and Restricted Words, J. Int. Seq., Vol. 21 (2018), Article 18.5.2.

Cf. A000984, A035324, A054336.

Row sums: A026671.

T:= function(n, k)
    if k mod 2=0 then return Binomial(2*n-k, n-Int(k/2))*Binomial(n-Int(k/2),Int(k/2))/Binomial(k,Int(k/2));
    else return 4^(n-k)*Binomial(n-Int((k-1)/2)-1, Int((k-1)/2));
    fi;
  end;
Flat(List([0..10], n-> List([0..n], k-> T(n, k) ))); # G. C. Greubel, Jul 20 2019

T:= func< n, k | (k mod 2) eq 0 select Binomial(2*n-k, n-Floor(k/2))* Binomial(n-Floor(k/2),Floor(k/2))/Binomial(k,Floor(k/2)) else 4^(n-k)*Binomial(n-Floor((k-1)/2)-1, Floor((k-1)/2)) >;
[[T(n,k): k in [0..n]]: n in [0..10]]; // G. C. Greubel, Jul 20 2019

A054335 := proc(n,k)
    if k <0 or k > n then
        0 ;
    elif type(k,odd) then
        kprime := floor(k/2) ;
        binomial(n-kprime-1,kprime)*4^(n-k) ;
    else
        kprime := k/2 ;
        binomial(2*n-k,n-kprime)*binomial(n-kprime,kprime)/binomial(k,kprime) ;
    end if;
end proc: # R. J. Mathar, Mar 12 2013
# Uses function PMatrix from A357368. Adds column 1,0,0,0,... to the left.
PMatrix(10, n -> binomial(2*(n-1), n-1)); # Peter Luschny, Oct 19 2022

Flatten[ CoefficientList[#1, x] & /@ CoefficientList[ Series[1/(Sqrt[1 - 4*z] - x*z), {z, 0, 9}], z]] (* or *)
a[n_, k_?OddQ] := 4^(n-k)*Binomial[(2*n-k-1)/2, (k-1)/2]; a[n_, k_?EvenQ] := (Binomial[n-k/2, k/2]*Binomial[2*n-k, n-k/2])/Binomial[k, k/2]; Table[a[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Sep 08 2011, updated Jan 16 2014 *)

T(n, k) = if(k%2==0, binomial(2*n-k, n-k/2)*binomial(n-k/2,k/2)/binomial(k,k/2), 4^(n-k)*binomial(n-(k-1)/2-1, (k-1)/2));
for(n=0,10, for(k=0,n, print1(T(n,k), ", "))) \\ G. C. Greubel, Jul 20 2019

def T(n, k):
    if (mod(k,2)==0): return binomial(2*n-k, n-k/2)*binomial(n-k/2,k/2)/binomial(k,k/2)
    else: return 4^(n-k)*binomial(n-(k-1)/2-1, (k-1)/2)
[[T(n,k) for k in (0..n)] for n in (0..10)] # G. C. Greubel, Jul 20 2019

a(n, 2*k+1) = binomial(n-k-1, k)*4^(n-2*k-1), a(n, 2*k) = binomial(2*(n-k), n-k)*binomial(n-k, k)/binomial(2*k, k), k >= 0, n >= m >= 0; a(n, m) := 0 if n

Column recursion: a(n, m)=2*(2*n-m-1)*a(n-1, m)/(n-m), n>m >= 0, a(m, m) := 1.

G.f. for column m: cbie(x)*(x*cbie(x))^m, with cbie(x) := 1/sqrt(1-4*x).

G.f.: 1/(1-x*y-2*x/(1-x/(1-x/(1-x/(1-x/(1-... (continued fraction). - Paul Barry, May 06 2009

Sum_{k>=0} T(n,2*k)*(-1)^k*A000108(k) = A000108(n+1). - Philippe Deléham, Jan 30 2012

Sum_{k=0..floor(n/2)} T(n-k,n-2*k) = A098615(n). - Philippe Deléham, Feb 01 2012

T(n,k) = 4*T(n-1,k) + T(n-2,k-2) for k>=1. - Philippe Deléham, Feb 02 2012

Vertical recurrence: T(n,k) = 1*T(n-1,k-1) + 2*T(n-2,k-1) + 6*T(n-3,k-1) + 20*T(n-4,k-1) + ... for k >= 1 (the coefficients 1, 2, 6, 20, ... are the central binomial coefficients A000984). - Peter Bala, Oct 17 2015

A050982 5-idempotent numbers.

Original entry on oeis.org

1, 30, 525, 7000, 78750, 787500, 7218750, 61875000, 502734375, 3910156250, 29326171875, 213281250000, 1510742187500, 10458984375000, 70971679687500, 473144531250000, 3105010986328125, 20091247558593750, 128360748291015625, 810699462890625000

Offset: 5

Eric W. Weisstein

Number of n-permutations of 6 objects: t,u,v,z,x, y with repetition allowed, containing exactly five u's. Example: a(6)=30 because we have 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. - Zerinvary Lajos, Jun 16 2008

Louis Comtet, Advanced Combinatorics, Reidel, 1974, p. 91, #43.

Vincenzo Librandi, Table of n, a(n) for n = 5..1000
Eric Weisstein's World of Mathematics, Idempotent Number.
Index entries for linear recurrences with constant coefficients, signature (30,-375,2500,-9375,18750,-15625).

Cf. A001788, A036216, A040075, A050988, A050989, A000389, A054849, A036219, A045543, A036084, A140404, A000389, A054849, A036219, A045543, A036084, A140404.

[Binomial(n, 5)*5^(n-5): n in [5..25]]; // Vincenzo Librandi, Aug 12 2017

seq(binomial(n, 5)*5^(n-5), n=5..32); # Zerinvary Lajos, Jun 16 2008

CoefficientList[Series[1 / (1 - 5 x)^6, {x, 0, 33}], x] (* Vincenzo Librandi, Aug 12 2017 *)

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

a(n) = C(n, 5)*5^(n-5).
G.f.: x^5/(1-5*x)^6. - Zerinvary Lajos, Aug 06 2008
From Amiram Eldar, Apr 17 2022: (Start)
Sum_{n>=5} 1/a(n) = 6400*log(5/4) - 17125/12.
Sum_{n>=5} (-1)^(n+1)/a(n) = 32400*log(6/5) - 23625/4. (End)

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)

A020922 Expansion of 1/(1-4*x)^(11/2).

Original entry on oeis.org

1, 22, 286, 2860, 24310, 184756, 1293292, 8498776, 53117350, 318704100, 1848483780, 10418726760, 57302997180, 308554600200, 1630931458200, 8480843582640, 43464323361030, 219878341708740, 1099391708543700, 5439095821216200, 26651569523959380, 129450480544945560

Offset: 0

N. J. A. Sloane

Also convolution of A000984 with A040075, also convolution of A000302 with A020920, also convolution of A002457 with A038846, also convolution of A002697 with A020918, also convolution of A002802 with A038845. - Rui Duarte, Oct 08 2011

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

Cf. A000302, A000984, A001622, A002457, A002697, A002802, A020918, A020920, A038845, A038846, A040075, A046521 (sixth column).

List([0..30], n-> Binomial(n+5, 5)*Binomial(2*n+10, n+5)/252); # G. C. Greubel, Jul 20 2019

[(2*n+9)*(2*n+7)*(2*n+5)*(2*n+3)*(2*n+1)*Binomial(2*n, n)/945: n in [0..30]] // Vincenzo Librandi, Jul 05 2013

CoefficientList[Series[1/(1-4x)^(11/2), {x,0,30}], x] (* Vincenzo Librandi, Jul 05 2013 *)

vector(30, n, n--; m=n+5; binomial(m, 5)*binomial(2*m, m)/252) \\ G. C. Greubel, Jul 20 2019

[binomial(n+5, 5)*binomial(2*n+10, n+5)/252 for n in (0..30)] # G. C. Greubel, Jul 20 2019

a(n) = binomial(n+5, 5)*A000984(n+5)/A000984(5), where A000984 are central binomial coefficients. - Wolfdieter Lang
From Rui Duarte, Oct 08 2011: (Start)
a(n) = ((2n+9)(2n+7)(2n+5)(2n+3)(2n+1)/(9*7*5*3*1)) * binomial(2n, n).
a(n) = binomial(2n+10, 10) * binomial(2n, n) / binomial(n+5, 5).
a(n) = binomial(n+5, 5) * binomial(2n+10, n+5) / binomial(10, 5).
a(n) = Sum_{ i_1+i_2+i_3+i_4+i_5+i_6+i_7+i_8+i_9+i_10+i_11 = n } f(i_1)* f(i_2)*f(i_3)*f(i_4)*f(i_5)*f(i_6)*f(i_7)*f(i_8)*f(i_9)*f(i_10)*f(i_11) with f(k)=A000984(k). (End)
Boas-Buck recurrence: a(n) = (22/n)*Sum_{k=0..n-1} 4^(n-k-1)*a(k), n >= 1, a(0) = 1. Proof from a(n) = A046521(n+5, 5). See a comment there. - Wolfdieter Lang, Aug 10 2017
From Amiram Eldar, Mar 25 2022: (Start)
Sum_{n>=0} 1/a(n) = 162*sqrt(3)*Pi - 30816/35.
Sum_{n>=0} (-1)^n/a(n) = 4500*sqrt(5)*log(phi) - 33888/7, where phi is the golden ratio (A001622). (End)

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

A045543 6-fold convolution of A000302 (powers of 4); expansion of 1/(1-4*x)^6.

Original entry on oeis.org

1, 24, 336, 3584, 32256, 258048, 1892352, 12976128, 84344832, 524812288, 3148873728, 18320719872, 103817412608, 574988746752, 3121367482368, 16647293239296, 87398289506304, 452414675091456, 2312341672689664, 11683410556747776, 58417052783738880, 289303499500421120

Offset: 0

Wolfdieter Lang

Also convolution of A020922 with A000984 (central binomial coefficients); also convolution of A040075 with A000302 (powers of 4).
With a different offset, number of n-permutations of 5 objects: u,v,z,x, y with repetition allowed, containing exactly five (5) u's. Example: a(1)=24 because we have uuuuuv uuuuvu uuuvuu uuvuuu uvuuuu vuuuuu uuuuuz uuuuzu uuuzuu uuzuuu uzuuuu zuuuuu uuuuux uuuuxu uuuxuu uuxuuu uxuuuu xuuuuu uuuuuy uuuuyu uuuyuu uuyuuu uyuuuu yuuuuu. - Zerinvary Lajos, Jun 16 2008
Also convolution of A002457 with A020920, also convolution of A002697 with A038846, also convolution of A002802 with A020918, also convolution of A038845 with A038845. - Rui Duarte, Oct 08 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..400
Index entries for linear recurrences with constant coefficients, signature (24,-240,1280,-3840,6144,-4096).

Cf. A038231.

List([0..30], n-> 4^n*Binomial(n+5,5)); # G. C. Greubel, Jul 20 2019

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

seq(seq(binomial(i+5, j)*4^i, j =i), i=0..30); # Zerinvary Lajos, Dec 03 2007
seq(binomial(n+5,5)*4^n,n=0..30); # Zerinvary Lajos, Jun 16 2008

CoefficientList[Series[1/(1-4x)^6,{x,0,30}],x] (* or *) LinearRecurrence[ {24,-240,1280,-3840,6144,-4096}, {1,24,336,3584,32256, 258048}, 30] (* Harvey P. Dale, Mar 24 2018 *)

Vec(1/(1-4*x)^6 + O(x^30)) \\ Michel Marcus, Aug 21 2015

[lucas_number2(n, 4, 0)*binomial(n,5)/2^10 for n in range(5, 35)] # Zerinvary Lajos, Mar 11 2009

a(n) = binomial(n+5, 5)*4^n.
G.f.: 1/(1-4*x)^6.
a(n) = Sum_{ i_1+i_2+i_3+i_4+i_5+i_6+i_7+i_8+i_9+i_10+i_11+i_12 = n} f(i_1)* f(i_2)*f(i_3)*f(i_4)*f(i_5)*f(i_6)*f(i_7)*f(i_8)*f(i_9)*f(i_10) *f(i_11)*f(i_12), with f(k)=A000984(k). - Rui Duarte, Oct 08 2011
E.g.f.: (15 + 120*x + 240*x^2 + 160*x^3 + 32*x^4)*exp(4*x)/3. - G. C. Greubel, Jul 20 2019
From Amiram Eldar, Mar 25 2022: (Start)
Sum_{n>=0} 1/a(n) = 1620*log(4/3) - 465.
Sum_{n>=0} (-1)^n/a(n) = 12500*log(5/4) - 8365/3. (End)

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)

Showing 1-10 of 14 results. Next

cp's OEIS Frontend

A045505 Convolution of A000108 (Catalan numbers) with A040075.

Views

Author

Keywords

Comments

Links

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

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

A054335 A convolution triangle of numbers based on A000984 (central binomial coefficients of even order).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A050982 5-idempotent numbers.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A050988 6-idempotent numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A020922 Expansion of 1/(1-4*x)^(11/2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP