A118930 -id:A118930 - cp's OEIS frontend

A152685 Triangle read by rows, A100861(n,k) * A118930(k).

1, 1, 1, 1, 1, 3, 1, 6, 6, 1, 10, 30, 1, 15, 90, 60, 1, 21, 210, 420, 1, 18, 420, 1680, 1365, 1, 36, 756, 5040, 12285, 1, 45, 1260, 12600, 61425, 38745, 1, 55, 1980, 27720, 225225, 426195, 1, 66, 2970, 55440, 675675, 2557170, 1725570, 1, 78, 4290

Offset: 0

Gary W. Adamson, Dec 10 2008

			First few rows of the triangle =
1;
1;
1, 1;
1, 3;
1, 6, 6;
1, 10, 30;
1, 15, 90, 60;
1, 21, 210, 420;
1, 28, 420, 1680, 1365;
1, 36, 756, 5040, 12285;
1, 45, 1260, 12600, 61425, 38745;
1, 55, 1980, 27720, 225225, 426195;
...

Cf. A100861, A118930 (row sums)

A152685 := proc(n,k)
    A100861(n,k)*A118930(k) ;
end proc:
seq(seq(A152685(n,k),k=0..n/2),n=0..13) ; # R. J. Mathar, Aug 19 2014

Triangle read by rows, A100861 * (A118930 * n^(n-k)) = M*Q. M = A100861 as an infinite lower triangular matrix and Q = a matrix with A118930 as the main diagonal and the rest zeros.

A100861 Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 6, 3, 1, 10, 15, 1, 15, 45, 15, 1, 21, 105, 105, 1, 28, 210, 420, 105, 1, 36, 378, 1260, 945, 1, 45, 630, 3150, 4725, 945, 1, 55, 990, 6930, 17325, 10395, 1, 66, 1485, 13860, 51975, 62370, 10395, 1, 78, 2145, 25740, 135135, 270270, 135135, 1, 91, 3003, 45045, 315315, 945945, 945945, 135135

Offset: 0

Emeric Deutsch, Jan 08 2005

Row n contains 1 + floor(n/2) terms. Row sums yield A000085. T(2n,n) = T(2n-1,n-1) = (2n-1)!! (A001147).
Inverse binomial transform is triangle with T(2n,n) = (2n-1)!!, 0 otherwise. - Paul Barry, May 21 2005
Equivalently, number of involutions of n with k pairs. - Franklin T. Adams-Watters, Jun 09 2006
From Gary W. Adamson, Dec 09 2009: (Start)
If considered as an infinite lower triangular matrix (cf. A144299),
lim_{n->} A100861^n = A118930: (1, 1, 2, 4, 13, 41, ...).
(End)
Sum_{k=0..floor(n/2)} T(n,k)m^(n-2k)s^(2k) is the n-th non-central moment of the normal probability distribution with mean m and standard deviation s. - Stanislav Sykora, Jun 19 2014
Row n is the list of coefficients of the independence polynomial of the n-triangular graph. - Eric W. Weisstein, Nov 11 2016
Restating the 2nd part of the Name, row n is the list of coefficients of the matching-generating polynomial of the complete graph K_n. - Eric W. Weisstein, Apr 03 2018

			T(4, 2) = 3 because in the graph with vertex set {A, B, C, D} and edge set {AB, BC, CD, AD, AC, BD} we have the following three 2-matchings: {AB, CD},{AC, BD} and {AD, BC}.
Triangle starts:
[0] 1;
[1] 1;
[2] 1,  1;
[3] 1,  3;
[4] 1,  6,   3;
[5] 1, 10,  15;
[6] 1, 15,  45,   15;
[7] 1, 21, 105,  105;
[8] 1, 28, 210,  420, 105;
[9] 1, 36, 378, 1260, 945.
.
From _Eric W. Weisstein_, Nov 11 2016: (Start)
As polynomials:
1,
1,
1 + x,
1 + 3*x,
1 + 6*x + 3*x^2,
1 + 10*x + 15*x^2,
1 + 15*x + 45*x^2 + 15*x^3. (End)

M. Abramowitz and I. Stegun, Handbook of Mathematical Functions (1983 reprint), 10th edition, 1964, expression 22.3.11 in page 775.
C. D. Godsil, Algebraic Combinatorics, Chapman & Hall, New York, 1993.

T. D. Noe, Rows n = 0..100, flattened
Paul Barry, The Gamma-Vectors of Pascal-like Triangles Defined by Riordan Arrays, arXiv:1804.05027 [math.CO], 2018.
Gérard Le Caër, A new family of solvable Pearson-Dirichlet random walks, Journal of Statistical Physics 144:1 (2011), pp. 23-45.
Ji Young Choi and Jonathan D. H. Smith, On the unimodality and combinatorics of Bessel numbers, Discrete Math., 264 (2003), 45-53.
Tom Copeland, Infinitesimal Generators, the Pascal Pyramid, and the Witt and Virasoro Algebras, 2012.
John Engbers, David Galvin, and Clifford Smyth, Restricted Stirling and Lah numbers and their inverses, arXiv:1610.05803 [math.CO], 2016.
Mikael Fremling, On the modular covariance properties of composite fermions on the torus, arXiv:1810.10391 [cond-mat.str-el], 2018.
Gary R. W. Greaves, Jeven Syatriadi, and Charissa I. Utomo, Chromatic polynomials of signed graphs and dominating-vertex deletion formulae, arXiv:2407.00883 [math.CO], 2024. See p. 11.
A. Hernando, R. Hernando, A. Plastino and A. R. Plastino, The workings of the Maximum Entropy Principle in collective human behavior, arXiv preprint arXiv:1201.0905 [stat.AP], 2012.
Robert S. Maier, Boson Operator Ordering Identities from Generalized Stirling and Eulerian Numbers, arXiv:2308.10332 [math.CO], 2023. See p. 18.
Aaron Pollack, Exceptional theta functions, arXiv:2211.05280 [math.NT], Nov 2022. See Lemma 7.5.1.
Eric Weisstein's World of Mathematics, Complete Graph
Eric Weisstein's World of Mathematics, Independence Polynomial
Eric Weisstein's World of Mathematics, Matching-Generating Polynomial
Eric Weisstein's World of Mathematics, Triangular Graph
Wikipedia, Normal distribution, section 'Moments'
Jian Zhou, Quantum deformation theory of the Airy curve and the mirror symmetry of a point, arXiv preprint arXiv:1405.5296 [math.AG], 2014.

Other versions of this same triangle are given in A144299, A001497, A001498, A111924.
Cf. A000085 (row sums).
Cf. A118930, A008619.

a100861 n k = a100861_tabf !! n !! k
a100861_row n = a100861_tabf !! n
a100861_tabf = zipWith take a008619_list a144299_tabl
-- Reinhard Zumkeller, Jan 02 2014

P[0]:=1: for n from 1 to 14 do P[n]:=sort(expand(P[n-1]+(n-1)*t*P[n-2])) od: for n from 0 to 14 do seq(coeff(t*P[n],t^k),k=1..1+floor(n/2)) od; # yields the sequence in triangular form
# Alternative:
A100861 := proc(n,k)
    n!/k!/(n-2*k)!/2^k ;
end proc:
seq(seq(A100861(n,k),k=0..n/2),n=0..10) ; # R. J. Mathar, Aug 19 2014

Table[Table[n!/(i! 2^i (n - 2 i)!), {i, 0, Floor[n/2]}], {n, 0, 10}] // Flatten  (* Geoffrey Critzer, Mar 27 2011 *)
CoefficientList[Table[2^(n/2) (-(1/x))^(-n/2) HypergeometricU[-n/2, 1/2, -1/(2 x)], {n, 0, 10}], x] // Flatten (* Eric W. Weisstein, Apr 03 2018 *)
CoefficientList[Table[(-I)^n Sqrt[x/2]^n HermiteH[n, I/Sqrt[2 x]], {n, 0, 10}], x] // Flatten (* Eric W. Weisstein, Apr 03 2018 *)

T(n,k)=if(k<0 || 2*k>n, 0, n!/k!/(n-2*k)!/2^k) /* Michael Somos, Jun 04 2005 */

T(n, k) = n!/(k!(n-2k)!*2^k).
E.g.f.: exp(z+tz^2/2).
G.f.: g(t, z) satisfies the differential equation g = 1 + zg + tz^2*(d/dz)(zg).
Row generating polynomial = P[n] = [-i*sqrt(t/2)]^n*H(n, i/sqrt(2t)), where H(n, x) is a Hermite polynomial and i=sqrt(-1). Row generating polynomials P[n] satisfy P[0]=1, P[n] = P[n-1] + (n-1)tP[n-2].
T(n, k) = binomial(n, 2k)(2k-1)!!. - Paul Barry, May 21 2002 [Corrected by Roland Hildebrand, Mar 06 2009]
T(n,k) = (n-2k+1)*T(n-1,k-1) + T(n-1,k). - Franklin T. Adams-Watters, Jun 09 2006
E.g.f.: 1 + (x+y*x^2/2)/(E(0)-(x+y*x^2/2)), where E(k) = 1 + (x+y*x^2/2)/(1 + (k+1)/E(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Nov 08 2013
T(n,k) = A144299(n,k), k=0..n/2. - Reinhard Zumkeller, Jan 02 2014

A144299 Triangle of Bessel numbers read by rows. Row n gives T(n,n), T(n,n-1), T(n,n-2), ..., T(n,0) for n >= 0.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 3, 0, 0, 1, 6, 3, 0, 0, 1, 10, 15, 0, 0, 0, 1, 15, 45, 15, 0, 0, 0, 1, 21, 105, 105, 0, 0, 0, 0, 1, 28, 210, 420, 105, 0, 0, 0, 0, 1, 36, 378, 1260, 945, 0, 0, 0, 0, 0, 1, 45, 630, 3150, 4725, 945, 0, 0, 0, 0, 0, 1, 55, 990, 6930, 17325, 10395, 0, 0, 0, 0, 0, 0

Offset: 0

David Applegate and N. J. A. Sloane, Dec 06 2008

T(n,k) is the number of partitions of an n-set into k nonempty subsets, each of size at most 2.
The Grosswald and Choi-Smith references give many further properties and formulas.
Considered as an infinite lower triangular matrix T, lim_{n->infinity} T^n = A118930: (1, 1, 2, 4, 13, 41, 166, 652, ...) as a vector. - Gary W. Adamson, Dec 08 2008

			Triangle begins:
  n:
  0: 1
  1: 1  0
  2: 1  1   0
  3: 1  3   0    0
  4: 1  6   3    0   0
  5: 1 10  15    0   0  0
  6: 1 15  45   15   0  0  0
  7: 1 21 105  105   0  0  0  0
  8: 1 28 210  420 105  0  0  0  0
  9: 1 36 378 1260 945  0  0  0  0  0
  ...
The row sums give A000085.
For some purposes it is convenient to rotate the triangle by 45 degrees:
  1 0 0 0 0  0  0   0   0    0    0     0 ...
    1 1 0 0  0  0   0   0    0    0     0 ...
      1 3 3  0  0   0   0    0    0     0 ...
        1 6 15 15   0   0    0    0     0 ...
          1 10 45 105 105    0    0     0 ...
             1 15 105 420  945  945     0 ...
                1  21 210 1260 4725 10395 ...
                    1  28  378 3150 17325 ...
                        1   36  630  6930 ...
                             1   45   990 ...
  ...
The latter triangle is important enough that it has its own entry, A144331. Here the column sums give A000085 and the rows sums give A001515.
If the entries in the rotated triangle are denoted by b1(n,k), n >= 0, k <= 2n, then we have the recurrence b1(n, k) = b1(n - 1, k - 1) + (k - 1)*b1(n - 1, k - 2).
Then b1(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1 or 2.

E. Grosswald, Bessel Polynomials, Lecture Notes Math., Vol. 698, 1978.

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened
David Applegate and N. J. A. Sloane, The Gift Exchange Problem, arXiv:0907.0513 [math.CO], 2009.
J. Y. Choi and J. D. H. Smith, On the unimodality and combinatorics of Bessel numbers, Discrete Math., 264 (2003), 45-53.
Tom Copeland, Infinitesimal Generators, the Pascal Pyramid, and the Witt and Virasoro Algebras
Toufik Mansour, Matthias Schork, and Mark Shattuck, The Generalized Stirling and Bell Numbers Revisited, Journal of Integer Sequences, Vol. 15 (2012), #12.8.3.
T. Mansour and M. Shattuck, Partial matchings and pattern avoidance, Appl. Anal. Discrete Math. 7 (2013) 25-50.

Other versions of this same triangle are given in A111924 (which omits the first row), A001498 (which left-adjusts the rows in the bottom view), A001497 and A100861. Row sums give A000085.

Cf. A000085, A000217, A001464, A004526, A118930, A144385, A144643..

a144299 n k = a144299_tabl !! n !! k
a144299_row n = a144299_tabl !! n
a144299_tabl = [1] : [1, 0] : f 1 [1] [1, 0] where
   f i us vs = ws : f (i + 1) vs ws where
               ws = (zipWith (+) (0 : map (i *) us) vs) ++ [0]
-- Reinhard Zumkeller, Jan 01 2014

A144299:= func< n,k | k le Floor(n/2) select Factorial(n)/(Factorial(n-2*k)*Factorial(k)*2^k) else 0 >;
[A144299(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Sep 29 2023

Maple code producing the rotated version:
b1 := proc(n, k)
option remember;
if n = k then 1;
elif k < n then 0;
elif n < 1 then 0;
else b1(n - 1, k - 1) + (k - 1)*b1(n - 1, k - 2);
end if;
end proc;
for n from 0 to 12 do lprint([seq(b1(n,k),k=0..2*n)]); od:

T[n_,0]=0; T[1,1]=1; T[2,1]=1; T[n_, k_]:= T[n-1,k-1] + (n-1)T[n-2,k-1];
Table[T[n,k], {n,12}, {k,n,1,-1}]//Flatten (* Robert G. Wilson v *)
Table[If[k<=Floor[n/2],n!/((n-2 k)! k! 2^k),0], {n, 0, 12},{k,0,n}]//Flatten (* Stefano Spezia, Jun 15 2023 *)

def A144299(n,k): return factorial(n)/(factorial(n-2*k)*factorial(k)*2^k) if k <= (n//2) else 0
flatten([[A144299(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Sep 29 2023

T(n, k) = T(n-1, k-1) + (n-1)*T(n-2, k-1).
E.g.f.: Sum_{k >= 0} Sum_{n = 0..2k} T(n,k) y^k x^n/n! = exp(y(x+x^2/2)). (The coefficient of y^k is the e.g.f. for the k-th row of the rotated triangle shown below.)
T(n, k) = n!/((n - 2*k)!*k!*2^k) for 0 <= k <= floor(n/2) and 0 otherwise. - Stefano Spezia, Jun 15 2023
From G. C. Greubel, Sep 29 2023: (Start)
T(n, 1) = A000217(n-1).
Sum_{k=0..n} T(n,k) = A000085(n).
Sum_{k=0..n} (-1)^k*T(n,k) = A001464(n). (End)

Offset fixed by Reinhard Zumkeller, Jan 01 2014

A118932 E.g.f.: A(x) = exp( Sum_{n>=0} x^(3^n)/3^((3^n -1)/2) ).

Original entry on oeis.org

1, 1, 1, 3, 9, 21, 81, 351, 1233, 10249, 75841, 388411, 3733401, 33702813, 215375889, 1984583511, 19181083041, 141963117201, 1797976123393, 22534941675379, 202605151063081, 2992764505338021, 43182110678814801, 445326641624332623

Offset: 0

Paul D. Hanna, May 06 2006

nonn

Equals invariant column vector V that satisfies matrix product A118931*V = V, where A118931(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0; thus a(n) = Sum_{k=0..floor(n/3)} A118931(n,k)*a(k), with a(0) = 1.

			E.g.f. A(x) = exp( x + x^3/3 + x^9/3^4 + x^27/3^13 + x^81/3^40 + ...)
= 1 + 1*x + 1*x^2/2! + 3*x^3/3! + 9*x^4/4! + 21*x^5/5! + 81*x^6/6! + ...

G. C. Greubel, Table of n, a(n) for n = 0..490

Cf. A118931.

Variants: A118930, A118935.

function a(n)
     F:=Factorial;
      if n eq 0 then return 1;
    else return (&+[F(n)*a(j)/(3^j*F(j)*F(n-3*j)): j in [0..Floor(n/3)]]);
      end if; return a; end function;
[a(n): n in [0..25]]; // G. C. Greubel, Mar 07 2021

a[n_]:= a[n]= If[n==0, 1, Sum[n!*a[k]/(3^k*k!*(n-3*k)!), {k, 0, Floor[n/3]}] ];
Table[a[n], {n, 0, 25}] (* G. C. Greubel, Mar 07 2021 *)

{a(n) = if(n==0,1,sum(k=0,n\3,n!/(k!*(n-3*k)!*3^k)*a(k)))}
for(n=0,30,print1(a(n),", "))

/* Defined by E.G.F.: */
{a(n) = n!*polcoeff( exp(sum(k=0,ceil(log(n+1)/log(3)),x^(3^k)/3^((3^k-1)/2))+x*O(x^n)),n,x)}
for(n=0,30,print1(a(n),", "))

@CachedFunction
def a(n):
    f=factorial;
    if n==0: return 1
    else: return sum( f(n)*a(k)/(3^k*f(k)*f(n-3*k)) for k in (0..n/3))
[a(n) for n in (0..25)] # G. C. Greubel, Mar 07 2021

a(n) = Sum_{k=0..floor(n/3)} (n!/(k!*(n-3*k)!*3^k)) * a(k), with a(0)=1.

A118393 Eigenvector of triangle A059344. E.g.f.: exp( Sum_{n>=0} x^(2^n) ).

Original entry on oeis.org

1, 1, 3, 7, 49, 201, 1411, 7183, 108417, 816049, 9966691, 80843511, 1381416433, 14049020857, 216003063459, 2309595457471, 72927332784001, 1046829280528353, 23403341433961027, 329565129021010279, 9695176730057249841, 160632514329660035881

Offset: 0

Paul D. Hanna, May 07 2006

nonn

E.g.f. of A059344 is: exp(x+y*x^2). More generally, given a triangle with e.g.f.: exp(x+y*x^b), the eigenvector will have e.g.f.: exp( Sum_{n>=0} x^(b^n) ).

Alois P. Heinz, Table of n, a(n) for n = 0..450

Cf. A059344, variants: A118395, A118930.

function a(n)
  if n eq 0 then return 1;
  else return (&+[ (Factorial(n)/(Factorial(k)*Factorial(n-2*k)))*a(k): k in [0..Floor(n/2)]]);
  end if; return a; end function;
[a(n): n in [0..25]]; // G. C. Greubel, Feb 18 2021

A118393 := proc(n)
    option remember;
    if n <=1 then
        1;
    else
        n!*add(procname(k)/k!/(n-2*k)!,k=0..n/2) ;
    end if;
end proc:
seq(A118393(n),n=0..20) ; # R. J. Mathar, Aug 19 2014
# second Maple program:
a:= proc(n) option remember; `if`(n=0, 1, add((j-> j!*
      a(n-j)*binomial(n-1, j-1))(2^i), i=0..ilog2(n)))
    end:
seq(a(n), n=0..25);  # Alois P. Heinz, Oct 01 2017

a[0] = 1; a[n_] := a[n] = Sum[n!/k!/(n - 2*k)!*a[k], {k, 0, n/2}];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, May 18 2018 *)

a(n)=n!*polcoeff(exp(sum(k=0,#binary(n),x^(2^k))+x*O(x^n)),n)

f=factorial;
def a(n): return 1 if n==0 else sum((f(n)/(f(k)*f(n-2*k)))*a(k) for k in (0..n//2))
[a(n) for n in (0..25)] # G. C. Greubel, Feb 18 2021

a(n) = Sum_{k=0..[n/2]} n!/k!/(n-2*k)! *a(k) for n>=0, with a(0)=1.

A118935 E.g.f.: A(x) = exp( Sum_{n>=0} x^(4^n)/4^((4^n-1)/3) ).

Original entry on oeis.org

1, 1, 1, 1, 7, 31, 91, 211, 1681, 12097, 57961, 209881, 1874071, 17842111, 117303187, 575683291, 26124309121, 412992394081, 3670397429041, 23161791013777, 729420726627271, 13374596287229311, 143560108604864491

Offset: 0

Paul D. Hanna, May 06 2006

nonn

Equals invariant column vector V that satisfies matrix product A118933*V = V, where A118933(n,k) = n!/[k!(n-4k)!*4^k] for n>=4*k>=0; thus a(n) = Sum_{k=0..[n/4]} A118933(n,k)*a(k), with a(0)=1.

			E.g.f. A(x) = exp( x + x^4/4 + x^16/4^5 + x^64/3^21 + x^256/3^85 +..)
= 1 + 1*x + 1*x^2/2! + 1*x^3/3! + 7*x^4/4! + 31*x^5/5!+ 91*x^6/6!+...

Cf. A118933; variants: A118930, A118932.

a(n)=if(n==0,1,sum(k=0,n\4,n!/(k!*(n-4*k)!*4^k)*a(k)))

/* Defined by E.G.F.: */ a(n)=n!*polcoeff( exp(sum(k=0,ceil(log(n+1)/log(4)),x^(4^k)/4^((4^k-1)/3))+x*O(x^n)),n,x)

a(n) = Sum_{k=0..[n/4]} n!/[k!*(n-4*k)!*4^k] * a(k), with a(0)=1.

cp's OEIS Frontend

A152685 Triangle read by rows, A100861(n,k) * A118930(k).

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Formula

A100861 Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

A144299 Triangle of Bessel numbers read by rows. Row n gives T(n,n), T(n,n-1), T(n,n-2), ..., T(n,0) for n >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

SageMath

Formula

Extensions

A118932 E.g.f.: A(x) = exp( Sum_{n>=0} x^(3^n)/3^((3^n -1)/2) ).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Sage

Formula

A118393 Eigenvector of triangle A059344. E.g.f.: exp( Sum_{n>=0} x^(2^n) ).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A118935 E.g.f.: A(x) = exp( Sum_{n>=0} x^(4^n)/4^((4^n-1)/3) ).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI