cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A115368 Decimal expansion of first zero of the Bessel function J_0(z).

Original entry on oeis.org

2, 4, 0, 4, 8, 2, 5, 5, 5, 7, 6, 9, 5, 7, 7, 2, 7, 6, 8, 6, 2, 1, 6, 3, 1, 8, 7, 9, 3, 2, 6, 4, 5, 4, 6, 4, 3, 1, 2, 4, 2, 4, 4, 9, 0, 9, 1, 4, 5, 9, 6, 7, 1, 3, 5, 7, 0, 6, 9, 9, 9, 0, 9, 0, 5, 9, 6, 7, 6, 5, 8, 3, 8, 6, 7, 7, 1, 9, 4, 0, 2, 9, 2, 0, 4, 4, 3, 6, 3, 4, 3, 7, 6, 0, 1, 4, 5, 2, 5, 4, 7, 8, 6, 8, 9
Offset: 1

Views

Author

Eric W. Weisstein, Jan 21 2006

Keywords

Comments

"This [constant] arises from the study of a vibrating, homogeneous membrane that is uniformly stretched across the unit disk. [Its square] is the principal frequency of the sound one hears when a kettledrum is struck." - Quoted from the book by Steven R. Finch.
Siegel proves (the Main Theorem) that J_0(z) is transcendental if z is algebraic and nonzero, but since in our case J_0(z) = 0 is not transcendental it follows that z cannot be algebraic. - Charles R Greathouse IV, Oct 20 2020

Examples

			2.4048255576957727686...
		

References

  • Chi Keung Cheung et al., Getting Started with Mathematica, 2nd Ed. New York: J. Wiley (2005) p. 7.
  • Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, p. 221.
  • C. Siegel, Über einige Anwendungen Diophantischer Approximationen, Abh. Preuss. Akad. Wiss. 1929/30, No. 1. Translated as "On some applications
  • of Diophantine approximations" by Clemens Fuchs.

Crossrefs

Programs

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

Views

Author

Johannes W. Meijer, Jul 27 2016

Keywords

Comments

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).

Examples

			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)
		

References

  • 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.

Crossrefs

Programs

  • Maple
    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.
  • Mathematica
    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 *)

Formula

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).
Showing 1-2 of 2 results.