Johannes W. Meijer - cp's OEIS frontend

A305402 A number triangle T(n,k) read by rows for 0<=k<=n, related to the Taylor expansion of f(u, p) = (1/2)(1+1/(sqrt(1-u^2)))exp(p*sqrt(1-u^2)).

1, 1, -2, 3, -4, 2, 15, -18, 9, -2, 105, -120, 60, -16, 2, 945, -1050, 525, -150, 25, -2, 10395, -11340, 5670, -1680, 315, -36, 2, 135135, -145530, 72765, -22050, 4410, -588, 49, -2, 2027025, -2162160, 1081080, -332640, 69300, -10080, 1008, -64, 2

Offset: 0

Johannes W. Meijer, May 31 2018

The function f(u, p) = (1/2)*(1+1/(sqrt(1-u^2))) * exp(p*sqrt(1-u^2)) was found while studying the Fresnel-Kirchhoff and the Rayleigh-Sommerfeld theories of diffraction, see the Meijer link.
The Taylor expansion of f(u, p) leads to the number triangle T(n, k), see the example section.
Normalization of the triangle terms, dividing the T(n, k) by T(n-k, 0), leads to A084534.
The row sums equal A003436, n >= 2, respectively A231622, n >= 1.

			The first few terms of the Taylor expansion of f(u; p) are:
f(u, p) = exp(p) * (1 + (1-2*p) * u^2/4 + (3-4*p+2*p^2) * u^4/16 + (15-18*p+9*p^2-2*p^3) * u^6/96 + (105-120*p+60*p^2-16*p^3+2*p^4) * u^8/768 + ... )
The first few rows of the T(n, k) triangle are:
n=0:     1
n=1:     1,     -2
n=2:     3,     -4,    2
n=3:    15,    -18,    9,    -2
n=4:   105,   -120,   60,   -16,   2
n=5:   945,  -1050,  525,  -150,  25,  -2
n=6: 10395, -11340, 5670, -1680, 315, -36, 2

J. W. Goodman, Introduction to Fourier Optics, 1996.
A. Papoulis, Systems and Transforms with Applications in Optics, 1968.

Andrew Howroyd, Rows n=0..50 of triangle, flattened
M. J. Bastiaans, The Wigner distribution function applied to optical signals and systems, Optics Communications, Vol. 25, nr. 1, pp. 26-30, 1978.
H. J. Butterweck, General theory of linear, coherent optical data processing systems, Journal of the Optical Society of America, Vol. 67, nr. 1, pp. 60-70, 1977.
J. W. Meijer, A note on optical diffraction, 1979.

Cf. A003436, A231622, A032184, A084534, A127674, A132062, A001497.
Cf. Related to the left hand columns: A001147, A001193, A261065.
Cf. Related to the right hand columns: A280560, A162395, A006011, A040977, A053347, A054334, A266561.

[[n le 0 select 1 else (-1)^k*2^(k-n+1)*Factorial(2*n-k-1)*Binomial(n, k)/Factorial(n-1): k in [0..n]]: n in [1..10]]; // G. C. Greubel, Nov 08 2018

T := proc(n, k): if n=0 then 1 else (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!) fi: end: seq(seq(T(n, k), k=0..n), n=0..8);

Table[If[n==0 && k==0,1, (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!)], {n, 0, 10}, {k,0,n}]//Flatten (* G. C. Greubel, Nov 08 2018 *)

T(n,k) = {if(n==0, 1, (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!))}
for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 08 2018

T(n, k) = (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!), n > 0 and 0 <= k <= n, T(0, 0) = 1.
T(n, k) = (-1)^k*A001147(n-k)*A084534(n, k), n >= 0 and 0 <= k <= n.
T(n, k) = 2^(2*(k-n)+1)*A001147(n-k)*A127674(n, n-k), n > 0 and 0 <= k <= n, T(0, 0) = 1.
T(n, k) = (-1)^k*(A001497(n, k) + A132062(n, k)), n >= 1, T(0,0) = 1.

A280443 a(n) = A280442(n)/A223067(n) = A067624(n)*A046161(n)/A223068(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 11, 17, 1, 23, 1, 11, 1, 1, 1, 17, 11, 1, 1, 1, 23, 11, 43, 17, 1, 1, 121, 1, 1, 1, 1, 4301, 1, 1, 1, 73, 11, 1, 1, 17, 1, 11, 23, 43, 1, 1, 11, 17, 1, 1, 1, 11, 101, 23, 89, 17, 11, 1, 1, 83, 1, 11, 1

Offset: 0

Johannes W. Meijer and Joseph Abate, Jan 03 2017

This sequence is related in a peculiar way to A223067 and A223068, sequences related to the complete elliptic integral of the first kind K(k), and to A280442 and A046161, sequences related to the unsigned Euler numbers A000364.
In this sequence certain prime numbers appear on a regular basis, either by itself or as a factor of a composite number, i.e., a(n)=11 if n=7+5*k, a(n)=17 if n=13+8*k, a(n)=23 if n=15+11*k, a(n)=43 if n=28+21*k, a(n)=73 if n=41+36*k, a(n)=101 if n=58+50*k, a(n)=89 if n=60+44*k, a(n)=83 if n=65+41*k, in all cases k >= 0. We observe that the period T of each prime is apparently T = (prime-1)/2.
Conjecture: The sequence A280443 will not have a(n)=1 after some point.

Cf. A000364 (Euler numbers), A046161, A067624, A223067, A223068, A280442.

nmax:=68: A067624 := n -> 2^(2*n)*(2*n)!: f := series((exp(add((-1)^n*euler(2*n) * x^n/(2*n), n=1..nmax+1))), x=0, nmax+1): for n from 0 to nmax do b(n) := coeff(f, x, n); a(n) := numer(b(n))/numer(b(n)/A067624(n)) od: seq(a(n), n=0..nmax);

def A280443_list(prec):
    P. = PowerSeriesRing(QQ, default_prec=2*prec)
    g = lambda x: exp(sum((-1)^k*euler_number(2*k)*x^k/(2*k) for k in (1..prec+1)))
    R = P(g(x)).coefficients()
    d = lambda n: 2*n - sum(n.digits(2))
    return [(2^d(n)*R[n]/(numerator(R[n]/factorial(2*n)))) for n in (0..prec)]
print(A280443_list(68)) # Peter Luschny, Jan 05 2017

a(n) = A280442(n)/A223067(n).
a(n) = A067624(n)*A046161(n)/A223068(n).
a(n) = A280442(n)/numer((A280442(n)/A046161(n))/A067624(n)).

A280442 Numerators of coefficients in the Taylor series expansion of Sum_{n>=0} exp((-1)^neuler(2n)x^n/(2n)).

Original entry on oeis.org

1, 1, 11, 173, 22931, 1319183, 233526463, 29412432709, 39959591850371, 8797116290975003, 4872532317019728133, 1657631603843299234219, 2718086236621937756966743, 1321397724505770800453750299, 1503342018433974345747514544039

Offset: 0

Johannes W. Meijer and Joseph Abate, Jan 03 2017

This sequence is related in a peculiar way to A223067, a sequence related to the period T of a simple gravity pendulum for arbitrary amplitudes. See A280443 for more information.

Sergey Khrushchev, Orthogonal Polynomials and Continued Fractions, From Euler's point of view, Corollary 4.26, p. 192, 2008.

Cf. A046161 (denominators).

Cf. A000364 (Euler numbers), A223067, A255881, A280443.

nmax:=14: f := series(exp(add((-1)^n*euler(2*n) * x^n/(2*n), n=1..nmax+1)), x=0, nmax+1): for n from 0 to nmax do a(n) := numer(coeff(f, x, n)) od: seq(a(n), n=0..nmax);

def A280442_list(prec):
    P. = PowerSeriesRing(QQ, default_prec=2*prec)
    def g(x): return exp(sum((-1)^k*euler_number(2*k)*x^k/(2*k) for k in (1..prec+1)))
    R = P(g(x)).coefficients()
    d = lambda n: 2^(2*n - sum(n.digits(2)))
    return [d(n)*R[n] for n in (0..prec)]
print(A280442_list(14)) # Peter Luschny, Jan 05 2017

a(n) = numerators of coefficients in the Taylor series expansion of Sum_{n>=0} exp((-1)^n * euler(2*n)*x^n/(2*n)).

Let S = Sum_{n>=0} (-1)^n*euler(2*n)*x^n/(2*n) and w(n) = A005187(n) then a(n) = 2^w(n) * [x^n] exp(S). - Peter Luschny, Jan 05 2017

A275594 Shifts 3 places left under MNL transform.

Original entry on oeis.org

1, 1, 1, 1, 2, 6, 24, 144, 1464, 26808, 935184, 67404816, 10401844896, 3508019017056, 2732681228689152, 5018025242941566336, 21914759744001662937984, 238559201308551667344338304, 6565759935393013059564090526464

Offset: 1

Johannes W. Meijer, Aug 03 2016

Shifts three places left under MNL transform, see A274760.

The Maple program is based on a program by Alois P. Heinz, see A007548 and A274804.

M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]

Cf. A274760, A007548, A274804, A132039, A275593.

mnltr:= proc(p) local g; g:= proc(n) option remember; `if` (n=0, 1, add(((n-1)!/(n-k)!)*p(k) *g(n-k), k=1..n)): end: end: d := mnltr(c): c := n->`if`(n<=3, 1, d(n-3)): A275594 := n-> c(n): seq(A275594(n), n=1..19);

mnltr[p_] := Module[{g}, g[n_] := g[n] = If [n == 0, 1, Sum[((n-1)!/(n-k)!) *p[k]*g[n-k], {k, 1 n}]]; g]; d = mnltr[c]; c [n_] := If[n <= 3, 1, d[n - 3]]; A275594[n_] := c[n]; Table[A275594[n], {n, 1, 19}] (* Jean-François Alcover, Jul 22 2017, translated from Maple *)

A275593 Shifts 2 places left under MNL transform.

Original entry on oeis.org

1, 1, 1, 2, 6, 30, 270, 5100, 229380, 27535260, 9496469340, 10086965678520, 34571745136244520, 403054252638271664040, 16565160940382442188713320, 2510059126960200448967150682000, 1444160075122431073529236697462766000

Offset: 1

Johannes W. Meijer, Aug 03 2016

Shifts two places left under MNL transform, see A274760.

The Maple program is based on a program by Alois P. Heinz, see A007548 and A274804.

M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]

Cf. A274760, A007548, A274804, A132039, A275594.

mnltr:= proc(p) local g; g:= proc(n) option remember; `if` (n=0, 1, add(((n-1)!/(n-k)!)*p(k) *g(n-k), k=1..n)): end: end: d := mnltr(c): c := n->`if`(n<=2, 1, d(n-2)): A275593 := n -> c(n): seq(A275593(n), n=1..16);

mnltr[p_] := Module[{g}, g[n_] := g[n] = If[n == 0, 1, Sum[((n-1)!/(n-k)!)* p[k]*g[n-k], {k, 1, n}]]; g]; d = mnltr[a]; a[n_] := If[n <= 2, 1, d[n-2] ]; Array[a, 17] (* Jean-François Alcover, Nov 07 2017, translated from Maple *)

A274844 The inverse multinomial transform of A001818(n) = ((2*n-1)!!)^2.

Original entry on oeis.org

1, 8, 100, 1664, 34336, 843776, 24046912, 779780096, 28357004800, 1143189536768, 50612287301632, 2441525866790912, 127479926768287744, 7163315850315825152, 431046122080208896000, 27655699473265974050816, 1884658377677216933085184

Offset: 1

Johannes W. Meijer, Jul 27 2016

nonn

The inverse multinomial transform [IML] transforms an input sequence b(n) into the output sequence a(n). The IML transform inverses the effect of the multinomial transform [MNL], see A274760, and is related to the logarithmic transform, see A274805 and the first formula.
To preserve the identity MNL[IML[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the MNL.
In the a(n) formulas, see the examples, the cumulant expansion numbers A127671 appear.
We observe that the inverse multinomial transform leaves the value of a(0) undefined.
The Maple programs can be used to generate the inverse multinomial transform of a sequence. The first program is derived from a formula given by Alois P. Heinz for the logarithmic transform, see the first formula and A001187. The second program uses the e.g.f. for multivariate row polynomials, see A127671 and the examples. The third program uses information about the inverse of the inverse of the multinomial transform, see A274760.
The IML transform of A001818(n) = ((2*n-1)!!)^2 leads quite unexpectedly to A005411(n), a sequence related to certain Feynman diagrams.
Some IML transform pairs, n >= 1: A000110(n) and 1/A000142(n-1); A137341(n) and A205543(n); A001044(n) and A003319(n+1); A005442(n) and A000204(n); A005443(n) and A001350(n); A007559(n) and A000244(n-1); A186685(n+1) and A131040(n-1); A061711(n) and A141151(n); A000246(n) and A000035(n); A001861(n) and A141044(n-1)/A001710(n-1); A002866(n) and A000225(n); A000262(n) and A000027(n).

			Some a(n) formulas, see A127671:
a(0) = undefined
a(1) = (1/0!) * (1*x(1))
a(2) = (1/1!) * (1*x(2) - x(1)^2)
a(3) = (1/2!) * (1*x(3) - 3*x(2)*x(1) + 2*x(1)^3)
a(4) = (1/3!) * (1*x(4) - 4*x(3)*x(1) - 3*x(2)^2 + 12*x(2)*x(1)^2 - 6*x(1)^4)
a(5) = (1/4!) * (1* x(5) - 5*x(4)*x(1) - 10*x(3)*x(2) + 20*x(3)*x(1)^2 + 30*x(2)^2*x(1) -60*x(2)*x(1)^3 + 24*x(1)^5)

Richard P. Feynman, QED, The strange theory of light and matter, 1985.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Logarithmic Transform.
Wikipedia, Feynman diagram

Cf. A274760, A274805, A127671, A001187, A001818, A000079, A005411.

nmax:=17: b := proc(n): (doublefactorial(2*n-1))^2 end: c:= proc(n) option remember; b(n) - add(k*binomial(n, k)*b(n-k)*c(k), k=1..n-1)/n end: a := proc(n): c(n)/(n-1)! end: seq(a(n), n=1..nmax); # End first IML program.
nmax:=17: b := proc(n): (doublefactorial(2*n-1))^2 end: t1 := log(1+add(b(n)*x^n/n!, n=1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n*coeff(t2, x, n) end: seq(a(n), n=1..nmax); # End second IML program.
nmax:=17: b := proc(n): (doublefactorial(2*n-1))^2 end: f := series(exp(add(t(n)*x^n/n, n=1..nmax)), x, nmax+1): d := proc(n): n!*coeff(f, x, n) end: a(1):=b(1): t(1):= b(1): for n from 2 to nmax+1 do t(n) := solve(d(n)-b(n), t(n)): a(n):=t(n): od: seq(a(n), n=1..nmax); # End third IML program.

nMax = 22; b[n_] := ((2*n-1)!!)^2; c[n_] := c[n] = b[n] - Sum[k*Binomial[n, k]*b[n-k]*c[k], {k, 1, n-1}]/n; a[n_] := c[n]/(n-1)!; Table[a[n], {n, 1, nMax}] (* Jean-François Alcover, Feb 27 2017, translated from Maple *)

a(n) = c(n)/(n-1)! with c(n) = b(n) - Sum_{k=1..n-1}(k*binomial(n, k)*b(n-k)*c(k)), n >= 1 and a(0) = undefined, with b(n) = A001818(n) = ((2*n-1)!!)^2.

a(n) = A000079(n-1) * A005411(n), n >= 1.

A274805 The logarithmic transform of sigma(n).

Original entry on oeis.org

1, 2, -3, -6, 45, 11, -1372, 4298, 59244, -573463, -2432023, 75984243, -136498141, -10881169822, 100704750342, 1514280063802, -36086469752977, -102642110690866, 11883894518252419, -77863424962770751, -3705485804176583500, 71306510264347489177

Offset: 1

Johannes W. Meijer, Jul 27 2016

sign

The logarithmic transform [LOG] transforms an input sequence b(n) into the output sequence a(n). The LOG transform is the inverse of the exponential transform [EXP], see the Weisstein link and the Sloane and Plouffe reference. This relation goes by the name of Riddell’s formula. For information about the EXP transform see A274804. The logarithmic transform is related to the inverse multinomial transform, see A274844 and the first formula.
The definition of the LOG transform, see the second formula, shows that n >= 1. To preserve the identity EXP[LOG[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the LOG transform, otherwise information about b(0) will be lost in transformation.
In the a(n) formulas, see the examples, the cumulant expansion numbers A127671 appear.
We observe that the logarithmic transform leaves the value of a(0) undefined.
The Maple programs can be used to generate the logarithmic transform of a sequence. The first program uses a formula found by Alois P. Heinz, see A001187 and the first formula. The second program uses the definition of the logarithmic transform, see the Weisstein link and the second formula. The third program uses information about the inverse of the logarithmic transform, see A274804.

			Some a(n) formulas, see A127671:
a(0) = undefined
a(1) = 1*x(1)
a(2) = 1*x(2) - x(1)^2
a(3) = 1*x(3) - 3*x(1)*x(2) + 2*x(1)^3
a(4) = 1*x(4) - 4*x(1)*x(3) - 3*x(2)^2 + 12*x(1)^2*x(2) - 6*x(1)^4
a(5) = 1*x(5) - 5*x(1)*x(4) - 10*x(2)*x(3) + 20*x(1)^2*x(3) + 30*x(1)*x(2)^2 - 60*x(1)^3*x(2) + 24*x(1)^5

Frank Harary and Edgar M. Palmer, Graphical Enumeration, 1973.
Robert James Riddell, Contributions to the theory of condensation, Dissertation, University of Michigan, Ann Arbor, 1951.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

Alois P. Heinz, Table of n, a(n) for n = 1..451
M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Logarithmic Transform.

Some LOG transform pairs are, n >= 1: A006125(n-1) and A033678(n); A006125(n) and A001187(n); A006125(n+1) and A062740(n); A000045(n) and A112005(n); A000045(n+1) and A007553(n); A000040(n) and A007447(n); A000051(n) and (-1)*A263968(n-1); A002416(n) and A062738(n); A000290(n) and A033464(n-1); A029725(n-1) and A116652(n-1); A052332(n) and A002031(n+1); A027641(n)/A027642(n) and (-1)*A060054(n+1)/(A075180(n-1).
Cf. A274804, A274844, A127671, A000203.
Cf. A112005, A007553, A062740, A007447, A062738, A033464, A116652, A002031, A003704, A003707, A155585, A000142, A226968.

nmax:=22: with(numtheory): b := proc(n): sigma(n) end: a:= proc(n) option remember; b(n) - add(k*binomial(n, k)*b(n-k)*a(k), k=1..n-1)/n: end: seq(a(n), n=1..nmax); # End first LOG program.
nmax:=22: with(numtheory): b := proc(n): sigma(n) end: t1 := log(1 + add(b(n)*x^n/n!, n=1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n!*coeff(t2, x, n) end: seq(a(n), n=1..nmax); # End second LOG program.
nmax:=22: with(numtheory): b := proc(n): sigma(n) end: f := series(exp(add(r(n)*x^n/n!, n=1..nmax+1)), x, nmax+1): d := proc(n): n!*coeff(f, x, n) end: a(1):=b(1): r(1):= b(1): for n from 2 to nmax+1 do r(n) := solve(d(n)-b(n), r(n)): a(n):=r(n): od: seq(a(n), n=1..nmax); # End third LOG program.

a[1] = 1; a[n_] := a[n] = DivisorSigma[1, n] - Sum[k*Binomial[n, k] * DivisorSigma[1, n-k]*a[k], {k, 1, n-1}]/n; Table[a[n], {n, 1, 22}] (* Jean-François Alcover, Feb 27 2017 *)

N=33; x='x+O('x^N); Vec(serlaplace(log(1+sum(n=1,N,sigma(n)*x^n/n!)))) \\ Joerg Arndt, Feb 27 2017

a(n) = b(n) - Sum_{k = 1..n-1}((k*binomial(n, k)*b(n-k)*a(k))/n), n >= 1, with b(n) = A000203(n) = sigma(n).

E.g.f. log(1+ Sum_{n >= 1}(b(n)*x^n/n!)), n >= 1, with b(n) = A000203(n) = sigma(n).

A274804 The exponential transform of sigma(n).

Original entry on oeis.org

1, 1, 4, 14, 69, 367, 2284, 15430, 115146, 924555, 7991892, 73547322, 718621516, 7410375897, 80405501540, 914492881330, 10873902417225, 134808633318271, 1738734267608613, 23282225008741565, 323082222240744379, 4638440974576329923, 68794595993688306903

Offset: 0

Johannes W. Meijer, Jul 27 2016

nonn

The exponential transform [EXP] transforms an input sequence b(n) into the output sequence a(n). The EXP transform is the inverse of the logarithmic transform [LOG], see the Weisstein link and the Sloane and Plouffe reference. This relation goes by the name of Riddell's formula. For information about the logarithmic transform see A274805. The EXP transform is related to the multinomial transform, see A274760 and the second formula.
The definition of the EXP transform, see the second formula, shows that n >= 1. To preserve the identity LOG[EXP[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the exponential transform, otherwise information about b(0) will be lost in transformation.
In the a(n) formulas, see the examples, the multinomial coefficients A178867 appear.
We observe that a(0) = 1 and provides no information about any value of b(n), this notwithstanding it is customary to start the a(n) sequence with a(0) = 1.
The Maple programs can be used to generate the exponential transform of a sequence. The first program uses a formula found by Alois P. Heinz, see A007446 and the first formula. The second program uses the definition of the exponential transform, see the Weisstein link and the second formula. The third program uses information about the inverse of the exponential transform, see A274805.
Some EXP transform pairs are, n >= 1: A000435(n) and A065440(n-1); 1/A000027(n) and A177208(n-1)/A177209(n-1); A000670(n) and A075729(n-1); A000670(n-1) and A014304(n-1); A000045(n) and A256180(n-1); A000290(n) and A033462(n-1); A006125(n) and A197505(n-1); A053549(n) and A198046(n-1); A000311(n) and A006351(n); A030019(n) and A134954(n-1); A038048(n) and A053529(n-1); A193356(n) and A003727(n-1).

			Some a(n) formulas, see A178867:
a(0) = 1
a(1) = x(1)
a(2) = x(1)^2 + x(2)
a(3) = x(1)^3 + 3*x(1)*x(2) + x(3)
a(4) = x(1)^4 + 6*x(1)^2*x(2) + 4*x(1)*x(3) + 3*x(2)^2 + x(4)
a(5) = x(1)^5 + 10*x(1)^3*x(2) + 10*x(1)^2*x(3) + 15*x(1)*x(2)^2 + 5*x(1)*x(4) + 10*x(2)*x(3) + x(5)

Frank Harary and Edgar M. Palmer, Graphical Enumeration, 1973.
Robert James Riddell, Contributions to the theory of condensation, Dissertation, University of Michigan, Ann Arbor, 1951.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

Alois P. Heinz, Table of n, a(n) for n = 0..531
M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Exponential Transform.

Cf. A274805, A274760, A178867, A000203, A007446.
Cf. A177208, A177209, A006351, A197505, A144180, A256180, A033462, A198046, A134954, A145460, A188489, A005432, A029725, A124213, A002801.
Cf. A036040, another version.

nmax:=21: with(numtheory): b := proc(n): sigma(n) end: a:= proc(n) option remember; if n=0 then 1 else add(binomial(n-1, j-1) * b(j) *a(n-j), j=1..n) fi: end: seq(a(n), n=0..nmax); # End first EXP program.
nmax:= 21: with(numtheory): b := proc(n): sigma(n) end: t1 := exp(add(b(n)*x^n/n!, n=1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n!*coeff(t2, x, n) end: seq(a(n), n=0..nmax); # End second EXP program.
nmax:=21: with(numtheory): b := proc(n): sigma(n) end: f := series(log(1+add(q(n)*x^n/n!, n=1..nmax+1)), x, nmax+1): d := proc(n): n!*coeff(f, x, n) end: a(0):=1: q(0):=1: a(1):=b(1): q(1):=b(1): for n from 2 to nmax+1 do q(n) := solve(d(n)-b(n), q(n)): a(n):=q(n): od: seq(a(n), n=0..nmax); # End third EXP program.

a[0] = 1; a[n_] := a[n] = Sum[Binomial[n-1, j-1]*DivisorSigma[1, j]*a[n-j], {j, 1, n}]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 22 2017 *)
nmax = 20; CoefficientList[Series[Exp[Sum[DivisorSigma[1, k]*x^k/k!, {k, 1, nmax}]], {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Jun 08 2021 *)

a(n) = Sum_{j=1..n} (binomial(n-1,j-1) * b(j) * a(n-j)), n >= 1 and a(0) = 1, with b(n) = A000203(n) = sigma(n).

E.g.f.: exp(Sum_{n >= 1} b(n)*x^n/n!) with b(n) = sigma(n) = A000203(n).

A274760 The multinomial transform of A001818(n) = ((2*n-1)!!)^2.

Original entry on oeis.org

1, 1, 10, 478, 68248, 21809656, 13107532816, 13244650672240, 20818058883902848, 48069880140604832128, 156044927762422185270016, 687740710497308621254625536, 4000181720339888446834235653120, 29991260979682976913756629498334208

Offset: 0

Johannes W. Meijer, Jul 27 2016

nonn

The multinomial transform [MNL] transforms an input sequence b(n) into the output sequence a(n). Given the fact that the structure of the a(n) formulas, see the examples, lead to the multinomial coefficients A036039 the MNL transform seems to be an appropriate name for this transform. The multinomial transform is related to the exponential transform, see A274804 and the third formula. For the inverse multinomial transform [IML] see A274844.
To preserve the identity IML[MNL[b(n)]] = b(n) for n >= 0 for a sequence b(n) with offset 0 the shifted sequence b(n-1) with offset 1 has to be used as input for the MNL, otherwise information about b(0) will be lost in transformation.
In the a(n) formulas, see the examples, the multinomial coefficients A036039 appear.
We observe that a(0) = 1 and that this term provides no information about any value of b(n), this notwithstanding we will start the a(n) sequence with a(0) = 1.
The Maple programs can be used to generate the multinomial transform of a sequence. The first program uses the first formula which was found by Paul D. Hanna, see A158876, and Vladimir Kruchinin, see A215915. The second program uses properties of the e.g.f., see the sequences A158876, A213507, A244430 and A274539 and the third formula. The third program uses information about the inverse multinomial transform, see A274844.
Some MNL transform pairs are, n >= 1: A000045(n) and A244430(n-1); A000045(n+1) and A213527(n-1); A000108(n) and A213507(n-1); A000108(n-1) and A243953(n-1); A000142(n) and A158876(n-1); A000203(n) and A053529(n-1); A000110(n) and A274539(n-1); A000041(n) and A215915(n-1); A000035(n-1) and A177145(n-1); A179184(n) and A038205(n-1); A267936(n) and A000266(n-1); A267871(n) and A000090(n-1); A193356(n) and A088009(n-1).

			Some a(n) formulas, see A036039:
  a(0) = 1
  a(1) = 1*x(1)
  a(2) = 1*x(2) + 1*x(1)^2
  a(3) = 2*x(3) + 3*x(1)*x(2) + 1*x(1)^3
  a(4) = 6*x(4) + 8*x(1)*x(3) + 3*x(2)^2 + 6*x(1)^2*x(2) + 1*x(1)^4
  a(5) = 24*x(5) + 30*x(1)*x(4) + 20*x(2)*x(3) + 20*x(1)^2*x(3) + 15*x(1)*x(2)^2 + 10*x(1)^3*x(2) + 1*x(1)^5

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 1995, pp. 18-23.

M. Bernstein and N. J. A. Sloane, Some Canonical Sequences of Integers, arXiv:math/0205301 [math.CO], 2002; Linear Algebra and its Applications, Vol. 226-228 (1995), pp. 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms.
Eric W. Weisstein MathWorld, Exponential Transform.

Cf. A274844, A274804, A036039, A001818, A001316, A215915, A008279.
Cf. A244430, A213527, A213507, A243953, A158876, A274539, A215915.
Cf. A090998, A008298, A271703, A112302, A135002, A274540.

nmax:= 13: b := proc(n): (doublefactorial(2*n-1))^2 end: a:= proc(n) option remember: if n=0 then 1 else add(((n-1)!/(n-k)!) * b(k) * a(n-k), k=1..n) fi: end: seq(a(n), n = 0..nmax); # End first MNL program.
nmax:=13: b := proc(n): (doublefactorial(2*n-1))^2 end: t1 := exp(add(b(n)*x^n/n, n = 1..nmax+1)): t2 := series(t1, x, nmax+1): a := proc(n): n!*coeff(t2, x, n) end: seq(a(n), n = 0..nmax); # End second MNL program.
nmax:=13: b := proc(n): (doublefactorial(2*n-1))^2 end: f := series(log(1+add(s(n)*x^n/n!, n=1..nmax)), x, nmax+1): d := proc(n): n*coeff(f, x, n) end: a(0) := 1: a(1) := b(1): s(1) := b(1): for n from 2 to nmax do s(n) := solve(d(n)-b(n), s(n)): a(n):=s(n): od: seq(a(n), n=0..nmax); # End third MNL program.

b[n_] := (2*n - 1)!!^2;
a[0] = 1; a[n_] := a[n] = Sum[((n-1)!/(n-k)!)*b[k]*a[n-k], {k, 1, n}];
Table[a[n], {n, 0, 13}] (* Jean-François Alcover, Nov 17 2017 *)

a(n) = Sum_{k=1..n} ((n-1)!/(n-k)!)*b(k)*a(n-k), n >= 1 and a(0) = 1, with b(n) = A001818(n) = ((2*n-1)!!)^2.
a(n) = n!*P(n), with P(n) = (1/n)*(Sum_{k=0..n-1} b(n-k)*P(k)), n >= 1 and P(0) = 1, with b(n) = A001818(n) = ((2*n-1)!!)^2.
E.g.f.: exp(Sum_{n >= 1} b(n)*x^n/n) with b(n) = A001818(n) = ((2*n-1)!!)^2.
denom(a(n)/2^n) = A001316(n); numer(a(n)/2^n) = [1, 1, 5, 239, 8531, 2726207, ...].

A264753 Irregular triangle read by rows: T(n,k) = A127671(n,k)/A036040(n,k), n >= 1 and 1 <= k <= A000041(n).

Original entry on oeis.org

1, 1, -1, 1, -1, 2, 1, -1, -1, 2, -6, 1, -1, -1, 2, 2, -6, 24, 1, -1, -1, -1, 2, 2, 2, -6, -6, 24, -120, 1, -1, -1, -1, 2, 2, 2, 2, -6, -6, -6, 24, 24, -120, 720, 1, -1, -1, -1, -1, 2, 2, 2, 2, 2, -6, -6, -6, -6, -6, 24, 24, 24, -120, -120, 720, -5040

Offset: 1

Johannes W. Meijer, Jul 12 2016

This sequence connects the multinomial coefficients A036040 (M_3) with A127671 (M_5).
The numbers of terms in n-th row is the number of partitions A000041(n). The number of terms T(n, k) with equal values in the n-th row follow the rhythm of A008284(n).
Some row sums are [1, 0, 2, -5, 21, -104, 636, -4511, 36455, -330954, 3334390, -36914039].

			The first few rows of the T(n,k) triangle:
n = 1: 1
n = 2: 1, -1
n = 3: 1, -1, 2
n = 4: 1, -1, -1, 2, -6
n = 5: 1, -1, -1, 2, 2, -6, 24
n = 6: 1, -1, -1, -1, 2, 2, 2, -6, -6, 24, -120
n = 7: 1, -1, -1, -1, 2, 2, 2, 2, -6, -6, -6, 24, 24, -120, 720

Milton Abramowitz and Irene A. Stegun, editors, Multinomials: M_1, M_2 and M_3, Handbook of Mathematical Functions, December 1972, pp. 831-2.

Cf. A036040 (M_3), A127671 (M_5), A000041, A008284, A081362.

Cf. A048996 (M_0), A036038 (M_1), A036039 (M_2), A117506 (M_4).

nmax:=8: with(combinat): A008284 := proc(n, k) option remember; if k < 0 or n < 0 then 0 elif k = 0 then if n = 0 then 1 else 0 fi else A008284(n-1, k-1) + A008284(n-k, k) fi end: for n from 1 to nmax do p:=0: k:=1: while k < numbpart(n)+1 do p := p+1: k1 := A008284(n, p): while k1 > 0 do A264753(n, k) := (-1)^(p+1)*(p-1)!: k := k+1: k1 := k1-1: od: od: od: seq(seq(A264753(n, k), k = 1..numbpart(n)), n = 1..nmax);

nMax = 8; A008284[n_, k_] := A008284[n, k] = If[k<0 || n<0, 0, If[k == 0, If[n == 0, 1, 0], A008284[n-1, k-1] + A008284[n-k, k]]]; For[n = 1, n <= nMax, n++, p = 0; k = 1; While[k < PartitionsP[n]+1, p = p+1; k1 = A008284[n, p]; While[k1>0, A264753[n, k] = (-1)^(p+1)*(p-1)!; k = k+1; k1 = k1-1]]]; Table[Table[A264753[n, k], {k, 1, PartitionsP[n]}], {n, 1, nMax}] // Flatten (* Jean-François Alcover, Oct 01 2016, translated from Maple *)

T(n, k) = A127671(n, k)/A036040(n, k), n >= 1 and 1 <= k <= A000041(n).

cp's OEIS Frontend

User: Johannes W. Meijer

A305402 A number triangle T(n,k) read by rows for 0<=k<=n, related to the Taylor expansion of f(u, p) = (1/2)*(1+1/(sqrt(1-u^2)))*exp(p*sqrt(1-u^2)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A280443 a(n) = A280442(n)/A223067(n) = A067624(n)*A046161(n)/A223068(n).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Sage

Formula

A280442 Numerators of coefficients in the Taylor series expansion of Sum_{n>=0} exp((-1)^n*euler(2*n)*x^n/(2*n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Sage

Formula

A275594 Shifts 3 places left under MNL transform.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

A275593 Shifts 2 places left under MNL transform.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

A274844 The inverse multinomial transform of A001818(n) = ((2*n-1)!!)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A274805 The logarithmic transform of sigma(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A305402 A number triangle T(n,k) read by rows for 0<=k<=n, related to the Taylor expansion of f(u, p) = (1/2)(1+1/(sqrt(1-u^2)))exp(p*sqrt(1-u^2)).

A280442 Numerators of coefficients in the Taylor series expansion of Sum_{n>=0} exp((-1)^neuler(2n)x^n/(2n)).