A002439 -id:A002439 - cp's OEIS frontend

A158690 Expansion of the basic hypergeometric series 1 + (1 - exp(-t)) + (1 - exp(-t))(1 - exp(-3t)) + (1 - exp(-t))(1 - exp(-3t))(1 - exp(-5t)) + ... as a series in t.

1, 1, 5, 55, 1073, 32671, 1431665, 85363615, 6646603073, 654896692351, 79656194515025, 11722538113191775, 2052949879753739873, 421931472111868912831, 100568330857984368195185

Offset: 0

Peter Bala, Mar 24 2009

We appear to get the same sequence by expanding 1 - (1 - exp(t)) + (1 - exp(t))*(1 - exp(2*t)) - (1 - exp(t))*(1 - exp(2*t))*(1 - exp(3*t)) + ... as a series in t. Compare with A079144. For other sequences with generating functions of a similar type see A000364, A000464, A002105 and A002439.
From Peter Bala, Mar 13 2017: (Start)
It appears that the g.f. has two other forms: either F(exp(-t)) where F(q) = Sum_{n >= 0} q^(n+1)*Product_{k = 1..n} 1 - q^(2*k) = q + q^2 + q^3 - q^7 - q^8 - q^10 - q^11 - ... is a g.f. for A003475 or 1/2*G(exp(t)) where G(q) = 1 + Sum_{n >= 0} (-1)^n*q^(n+1)*Product_{k = 1..n} 1 - q^k = 1 + q - q^2 + 2*q^3 - 2*q^4 + q^5 + q^7 - 2*q^8 + ... is a g.f. for A003406. See Zagier, Example 1. (End)
From Peter Bala, Dec 18 2021: (Start)
Conjectures:
1) Taking the sequence modulo an integer k gives an eventually periodic sequence with period dividing phi(k). For example, the sequence taken modulo 16 begins [1, 1, 5, 7, 1, 15, 1, 15, 1, 15, 1, 15, ...] with an apparent pre-period of length 4 and a period of length 2.
2) Let i >= 0 and define a_i(n) = a(n+i). Then for each i the Gauss congruences a_i(n*p^k) == a_i(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k.
If true, then for each i the expansion of exp( Sum_{n >= 1} a_i(n)*x^n/n ) has integer coefficients. For example, the expansion of exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 3*x^2 + 21*x^3 + 291*x^4 + 6861*x^5 + 246171*x^6 + 12458901*x^7 + 843915891*x^8 + 73640674461*x^9 + 8041227405771*x^10 + ... appears to have integer coefficients. (End)

			G.f. A(x) = 1 + x + 5*x^2 + 55*x^3 + 1073*x^4 + 32671*x^5 + 1431665*x^6 + ...

Vaclav Kotesovec, Table of n, a(n) for n = 0..170
Hsien-Kuei Hwang, and Emma Yu Jin, Asymptotics and statistics on Fishburn matrices and their generalizations, arXiv:1911.06690 [math.CO], 2019.
D. Zagier, Quantum modular forms, Quanta of Maths: Conference in honor of Alain Connes, Clay Mathematics Proceedings 11, AMS and Clay Mathematics Institute 2010, 659-675

Cf. A000364, A000464, A002105, A002439, A079144, A158691, A209832, A215066, A003406, A003475.

max = 14; se = Series[1 + Sum[ Product[1 - E^(-(2*k - 1)*t), {k, 1, n}], {n, 1, max}], {t, 0, max}]; CoefficientList[se, t]*Range[0, max]! (* Jean-François Alcover, Mar 06 2013 *)

{a(n)=n!*polcoeff(sum(m=0, n, prod(k=1, m, 1-exp(-(2*k-1)*x+x*O(x^n)))), n)} \\ Paul D. Hanna, Aug 01 2012

{a(n)=n!*polcoeff(sum(m=0, n, prod(k=1, m, exp(k*x+x*O(x^n))-1)), n)} \\ Paul D. Hanna, Aug 01 2012

Basic hypergeometric generating function: 1 + Sum_{n >= 0} Product_{k = 1..n} (1 - exp(2*k-1)*t) = 1 + t + 5*t^2/2! + 55*t^3/3! + ....
a(n) ~ 6*sqrt(2) * 12^n * (n!)^2 / Pi^(2*n+2). - Vaclav Kotesovec, May 04 2014
Conjectural g.f.: G(exp(t)) as a formal power series in t, where G(q) := Sum_{n >= 0} q^(2*n+1) * Product_{k = 1..2*n} (1 - q^k). - Peter Bala, May 16 2017
E.g.f.: Sum_{n>=0} exp(n*(n+1)/2*x) / Product_{k=0..n} (1 + exp(k*x)). - Paul D. Hanna, Oct 14 2020

A000191 Generalized tangent numbers d(3, n).

Original entry on oeis.org

2, 46, 3362, 515086, 135274562, 54276473326, 30884386347362, 23657073914466766, 23471059057478981762, 29279357851856595135406, 44855282210826271011257762, 82787899853638102222862479246, 181184428895772987376073015175362, 463938847087789978515380344866258286

Offset: 0

N. J. A. Sloane

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Peter Luschny, Table of n, a(n) for n = 0..250
Daniel Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967) 689-694.
Daniel Shanks, Corrigenda to: "Generalized Euler and class numbers", Math. Comp. 22 (1968), 699.
Daniel Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967), 689-694; 22 (1968), 690. [Annotated scanned copy]
Eric Weisstein's World of Mathematics, Tangent Number.

Cf. A000187, A000192, A002437, A002439, A156172, A235606 (row 3).

Cf. A000436, A007289, overview in A349264.

gf := (2*sin(t))/(2*cos(2*t) - 1): ser := series(gf, t, 26):
seq((2*n+1)!*coeff(ser, t, 2*n+1), n=0..23); # Peter Luschny, Oct 17 2020
a := n -> (-1)^n*(-6)^(2*n+1)*euler(2*n+1, 1/6):
seq(a(n), n = 0..13); # Peter Luschny, Nov 26 2020

(* Formulas from D. Shanks, see link, p. 690. *)
L[ a_, s_, t_:10000 ] := Plus@@Table[ N[ JacobiSymbol[ -a, 2k+1 ](2k+1)^(-s), 30 ], {k, 0, t} ]; d[ a_, n_, t_:10000 ] := (2n-1)!/Sqrt[ a ](2a/Pi)^(2n)L[ -a, 2n, t ] (* Eric W. Weisstein, Aug 30 2001 *)

a(n) = 2*A002439(n). - N. J. A. Sloane, Nov 06 2009
E.g.f.: (2*sin(t))/(2*cos(2*t) - 1), odd terms only. - Peter Luschny, Oct 17 2020
Alternative form for e.g.f.: a(n) = (2*n+1)!*[x^(2*n)](sqrt(3)/(6*x))*(sec(x + Pi/3) + sec(x + 2*Pi/3)). - Peter Bala, Nov 16 2020
a(n) = (-1)^(n+1)*6^(2*n+1)*euler(2*n+1, 1/6). - Peter Luschny, Nov 26 2020

More terms from Eric W. Weisstein, Aug 30 2001

Offset set to 0 by Peter Luschny, Nov 26 2020

A079144 Number of labeled interval orders on n elements: (2+2)-free posets.

Original entry on oeis.org

1, 1, 3, 19, 207, 3451, 81663, 2602699, 107477247, 5581680571, 356046745023, 27365431508779, 2494237642655487, 266005087863259291, 32815976815540917183, 4636895313201764853259, 743988605732990946684927

Offset: 0

Detlef Pauly (dettodet(AT)yahoo.de), Dec 27 2002

From Peter Bala, Dec 26 2021: (Start)
We make the following conjectures:
1) Taking the sequence modulo an integer k gives an eventually periodic sequence with period dividing phi(k). For example, the sequence taken modulo 8 begins [1, 1, 3, 3, 7, 3, 7, 3, 7,  ...] and appears to have a pre-period of length 3 and a period of length 2 = (1/2)*phi(8).
2) Let i >= 0 and define a_i(n) = a(n+i). Then for each i the Gauss congruences a_i(n*p^k) == a_i(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k. If true, then for each i the expansion of exp( Sum_{n >= 1} a_i(n)*x^n/n ) has integer coefficients. (End)

			1 + x + 3*x^2 + 19*x^3 + 207*x^4 + 3451*x^5 + 81663*x^6 + 2602699*x^7 + ...

Alois P. Heinz, Table of n, a(n) for n = 0..260
Peter Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
Graham Brightwell and Mitchel T. Keller, Asymptotic Enumeration of Labelled Interval Orders, arXiv:1111.6766 [math.CO], 2011.
Anders Claesson, Mark Dukes and Martina Kubitzke, Partition and composition matrices, arXiv:1006.1312 [math.CO], 2010-2011.
Hsien-Kuei Hwang and Emma Yu Jin, Asymptotics and statistics on Fishburn matrices and their generalizations, arXiv:1911.06690 [math.CO], 2019.
Don Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta-function, Topology, vol.40, pp.945-960 (2001); see p. 952.
Yan X Zhang, Four Variations on Graded Posets, arXiv preprint arXiv:1508.00318 [math.CO], 2015.

Cf. A022493 (unlabeled interval orders).
Cf. A002439 (Glaisher's T numbers), A002114 (Glaisher's H numbers).
Cf. A001318, A138265.

A002439 := proc(n) option remember; if n = 0 then 1; else (-4)^n-add((-9)^k*binomial(2*n+1,2*k)*procname(n-k),k=1..n+1) ; end if;end proc:
seq(1/(24^n)*add(binomial(n,k)*A002439(k), k = 0..n), n = 0..20); # Peter Bala, Dec 26 2021

nmax=20; rk=Rest[CoefficientList[Series[Sum[Product[1-1/(1+x)^j,{j,1,n}],{n,0,nmax}],{x,0,nmax}],x]]; Flatten[{1,Table[Sum[rk[[k]] * k! * StirlingS2[n,k],{k,1,n}],{n,1,nmax}]}] (* Vaclav Kotesovec, May 03 2014 *)

{a(n) = if( n<0, 0, n! * polcoeff( subst( sum( i=0, n, prod( j=1, i, 1 - (1 - x + O(x^(n - i + 2)))^j )), x, 1 - exp( -x + x * O(x^n))), n))} /* Michael Somos, Apr 01 2012 */

a(n) = (1/(24^n))*Sum_{k=0..n} binomial(n, k)*A002439(k). Zagier 2001, p. 954.
G.f.: Sum(Product(1-exp(-k*x),k = 1 .. n),n = 0 .. infinity). a(n) = Sum_{k=0..n} k!*Stirling2(n,k)*A138265(k). - Vladeta Jovovic, Mar 11 2008
From Peter Bala, Mar 19 2009: (Start)
Conjectural form for the o.g.f. as a continued fraction:
1/(1-x/(1-2*x/(1-5*x/(1-7*x/(1-12*x/(1-15*x/(1- ...))))))) = 1 + x + 3*x^2 + 19*x^3 + 207*x^4 + ..., where the sequence [1,2,5,7,12,15,..] is the sequence of generalized pentagonal numbers A001318. Compare with the continued fraction form of the o.g.f. of A002105. (End)
E.g.f.: 1+(exp(x)-1)/(G(0)+1-exp(x)), where G(k)= 2*exp(x*(k+1))-1-exp(x*(k+1))*(exp(x*(k+2))-1)/G(k+1); (continued fraction, Euler's kind, 1-step). - Sergei N. Gladkovskii, Jan 06 2012
Asymptotics (Brightwell and Keller, 2011): a(n) ~ 12*sqrt(3)/Pi^(5/2) * (n!)^2 * sqrt(n) * (6/Pi^2)^n. - Vaclav Kotesovec, May 03 2014
From Peter Bala, May 11 2017: (Start)
For a proof of above conjectural continued fraction representation of the o.g.f. see the Bala link.
G.f.: 1/(1 + x - 2*x/(1 - 1*x/(1 + x - 7*x/(1 - 5*x/(1 + x - 15*x/(1 - 12*x/(1 + x - 26*x/(1 - 22*x/(1 + x - ...))))))))), where the sequence of unsigned partial numerators [2, 1, 7, 5, 15, 12, ...] is obtained from A001318 by swapping adjacent terms.
E.g.f.: F(q) = Sum_{n >= 0} q^(n+1)*Product_{i = 1..n} (1 - q^i)^2 at q = exp(t). Note that F(q) at q = 1/(1 - t) is a g.f. for unlabeled interval orders A022493, and at q = 1 - t gives a g.f. for A138265. (End)
From Peter Bala, Dec 26 2021: (Start)
a(6*n + 5) == 0 (mod 7); a(10*n + 7) == 0 (mod 11);
a(12*n + 11) == 0 (mod 13); a(16*n + 5) == a(16*n + 8) == 0 (mod 17);
a(18*n + 3) == 0 (mod 19); a(22*n + 4) == 0 (mod 23). (End)

A002437 a(n) = A000364(n) * (3^(2*n+1) + 1)/4.

Original entry on oeis.org

1, 7, 305, 33367, 6815585, 2237423527, 1077270776465, 715153093789687, 626055764653322945, 698774745485355051847, 968553361387420436695025, 1632180870878422847476890007, 3286322019402928956112227932705, 7791592461957309952817483706344167, 21485762937086358457367440231243675985

Offset: 0

N. J. A. Sloane

The terms are multiples of the Euler numbers (A000364).

			a(4) = A000364(4) * (3^(2*4+1)+1)/4 = 1385 * (3^9+1)/4 = 1385 * 4921 = 6815585.

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 75.
J. W. L. Glaisher, Messenger of Math., 28 (1898), 36-79, see esp. p. 51.
L. B. W. Jolley, Summation of Series, Dover, 2nd ed. (1961)
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Michael E. Hoffman, Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences, The Electronic Journal of Combinatorics, vol. 6, no. 1, #R21, (1999).

Bisections: A156168, A156169.
Cf. A000191, A001209, A012494, A000364, A000281, A156134, A349429.
Cf. other sequences with a g.f. of the form cos(x)/(1 - k*sin^2(x)): A012494 (k=-1),  A001209 (k=1/2), A000364 (k=1), A000281 (k=2), A156134 (k=3).

Q:=proc(n) option remember; if n=0 then RETURN(1); else RETURN(expand((u^2+1)*diff(Q(n-1),u)+u*Q(n-1))); fi; end;
[seq(subs(u=sqrt(3),Q(2*n)),n=0..25)];

Table[Abs[EulerE[2 n]] (3^(2 n + 1) + 1) / 4, {n, 0, 30}] (* Vincenzo Librandi, Feb 07 2017 *)

A000364(n) * (3^(2*n+1) + 1)/4.
Q_2n(sqrt(3)), where the polynomials Q_n() are defined in A104035. - N. J. A. Sloane, Nov 06 2009
a(n) = (-1)^n*Sum_{k = 0..2*n-1} w^(2*n+k)*Sum_{j = 1..2*n-1} (-1)^(k-j)*binomial(2*n-1,k-j)*(2*j - 1)^(2*n-2), where  w = exp(2*Pi*i/6) (i = sqrt(-1)). Cf. A002439. - Peter Bala, Jan 21 2011
Sum_{n>=1} (-1)^floor((n-1)/2) 1/A007310(n)^s = r_s with r_{2s+1} = 2 *(Pi/6)^(2s+1) *a(s) /(2s)!. [Jolley eq (315)]. - R. J. Mathar, Mar 24 2011
From Peter Bala, Feb 06 2017: (Start)
E.g.f.: cos(x)^2/cos(3*x) = cos(x)/(1 - 4*sin(x)^2) = 1 + 7*x^2/2! + 305*x^4/4! + 33367*x^6/6! + .... This is the even part of (1/2)*sec(x + Pi/3). Cf. A000191. (End)
a(n) = (1/2)*Integral_{x = 0..inf} x^(2*n)*cosh(Pi*x/3)/cosh(Pi*x/2) dx. - Cf. A000281. - Peter Bala, Nov 08 2019

More terms from Herman P. Robinson

Further terms from N. J. A. Sloane, Nov 06 2009

A000498 Eulerian numbers (Euler's triangle: column k=4 of A008292, column k=3 of A173018).

Original entry on oeis.org

1, 26, 302, 2416, 15619, 88234, 455192, 2203488, 10187685, 45533450, 198410786, 848090912, 3572085255, 14875399450, 61403313100, 251732291184, 1026509354985, 4168403181210, 16871482830550, 68111623139600, 274419271461131, 1103881308184906, 4434992805213952

Offset: 4

N. J. A. Sloane, Mira Bernstein, and Robert G. Wilson v

There are 2 versions of Euler's triangle:
* A008292 Classic version of Euler's triangle used by Comtet (1974).
* A173018 Version of Euler's triangle used by Graham, Knuth and Patashnik in Concrete Math. (1990).
Euler's triangle rows and columns indexing conventions:
* A008292 The rows and columns of the Eulerian triangle are both indexed starting from 1. (Classic version: used in the classic books by Riordan and Comtet.)
* A173018 The rows and columns of the Eulerian triangle are both indexed starting from 0.(Graham et al.)
Number of permutations of n letters with exactly 3 descents.

			There is one permutation of 4 with exactly 3 descents (4321).
There are 26 permutations of 5 with 3 descents: 15432, 21543, 25431, 31542, 32154, 32541, 35421, 41532, 42153, 42531, 43152, 43215, 43251, 43521, 45321, 51432, 52143, 52431, 53142, 53214, 53241, 53421, 54132, 54213, 54231, 54312. - Neven Juric, Jan 21 2010.

L. Comtet, "Permutations by Number of Rises; Eulerian Numbers." §6.5 in Advanced Combinatorics: The Art of Finite and Infinite Expansions, rev. enl. ed. Dordrecht, Netherlands: Reidel, pp. 51 and 240-246, 1974.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 243.
F. N. David and D. E. Barton, Combinatorial Chance. Hafner, NY, 1962, p. 151.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 260.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 215.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 4..200
E. Banaian, S. Butler, C. Cox, J. Davis, J. Landgraf and S. Ponce A generalization of Eulerian numbers via rook placements, arXiv:1508.03673 [math.CO], 2015.
L. Carlitz et al., Permutations and sequences with repetitions by number of increases, J. Combin. Theory, 1 (1966), 350-374.
F. N. Castro, O. E. González, and L. A. Medina, The p-adic valuation of Eulerian numbers: trees and Bernoulli numbers, 2014.
E. T. Frankel, A calculus of figurate numbers and finite differences, American Mathematical Monthly, 57 (1950), 14-25. [Annotated scanned copy]
J. C. P. Miller, Letter to N. J. A. Sloane, Mar 26 1971
Nagatomo Nakamura, Pseudo-Normal Random Number Generation via the Eulerian Numbers, Josai Mathematical Monographs, vol. 8, p 85-95, 2015.
P. A. Piza, Kummer numbers, Mathematics Magazine, 21 (1947/1948), 257-260.
P. A. Piza, Kummer numbers, Mathematics Magazine, 21 (1947/1948), 257-260. [Annotated scanned copy]
J. Riordan, Review of Frankel (1950) [Annotated scanned copy]
Eric Weisstein's World of Mathematics, Eulerian Number
Robert G. Wilson v, Letter to N. J. A. Sloane, Apr. 1994
Index entries for linear recurrences with constant coefficients, signature (20,-175,882,-2835,6072,-8777,8458,-5204,1848,-288).

Cf. A008292 (classic version of Euler's triangle used by Comtet (1974).)
Cf. A173018 (version of Euler's triangle used by Graham, Knuth and Patashnik in Concrete Math. (1990).)
Cf. A066912.

[(6*4^n -6*(n+1)*3^n +3*n*(n+1)*2^n -(n-1)*n*(n+1))/6: n in [4..50]]; // G. C. Greubel, Oct 23 2017

[EulerianNumber(n,3): n in [4..50]]; // G. C. Greubel, Dec 07 2024

A000498:=proc(n); 4^n-(n+1)*3^n+1/2*(n)*(n+1)*2^n-1/6*(n-1)*(n)*(n+1); end:

LinearRecurrence[{20, -175, 882, -2835, 6072, -8777, 8458, -5204, 1848, -288}, {1, 26, 302, 2416, 15619, 88234, 455192, 2203488, 10187685, 45533450}, 30] (* Jean-François Alcover, Feb 09 2016 *)
Table[Sum[(-1)^k*Binomial[n+1,k]*(4-k)^n, {k,0,3}], {n,4,50}] (* G. C. Greubel, Oct 23 2017 *)

for(n=4,50, print1((6*4^n -6*(n+1)*3^n +3*n*(n+1)*2^n -(n-1)*n*(n+ 1))/6, ", ")) \\ G. C. Greubel, Oct 23 2017

from sage.combinat.combinat import eulerian_number
print([eulerian_number(n,3) for n in range(4,61)]) # G. C. Greubel, Dec 07 2024

From Mike Zabrocki, Nov 12 2004: (Start)
G.f.: x^4*(1 + 6*x - 43*x^2 + 44*x^3 + 52*x^4 - 72*x^5)/((1-x)^4 * (1-2*x)^3 * (1-3*x)^2 * (1-4*x)).
a(n) = (6*4^n - 6*(n + 1)*3^n + 3*(n)*(n + 1)*2^n - (n - 1)*(n)*(n + 1))/6. (End)
If n>3 is prime, then a(n) == 1 (mod n). A generalization: if a_t(n) denote the number of permutations of n letters with exactly t descents (column t+1 of Euler's triangle A008292), then, for prime n>t, we have a(n) == 1 (mod n). - Vladimir Shevelev, Sep 26 2010
E.g.f.: exp(x)*(exp(3*x) - (1 + 3*x)*exp(2*x) + 2*(x + 2*x^2/2!)*exp(x) - x^2/2! - x^3/3!). - Wolfdieter Lang, Apr 17 2017

More terms from Christian G. Bower, May 12 2000

A002111 Glaisher's G numbers.

Original entry on oeis.org

1, 5, 49, 809, 20317, 722813, 34607305, 2145998417, 167317266613, 16020403322021, 1848020950359841, 252778977216700025, 40453941942593304589, 7488583061542051450829, 1587688770629724715374457, 382218817191632327375004833

Offset: 1

N. J. A. Sloane

Related to the formula Sum_{k>0} sin(kx)/k^(2n+1)=(-1)^(n+1)/2*x^(2n+1)/(2n+1)! * Sum_{i=0..2n} (2Pi/x)^i*B(i)*C(2n+1,i). - Benoit Cloitre, May 01 2002

Named after the English mathematician and astronomer James Whitbread Lee Glaisher (1848-1928). - Amiram Eldar, Jun 16 2021

			G.f. = x + 5*x^2 + 49*x^3 + 809*x^4 + 20317*x^5 + 722813*x^6 + 34607305*x^7 + ...

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 76.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 1..254 (first 50 terms from T. D. Noe)
Shaun Cooper, Cubic elliptic functions, Res. Lett. Inf. Math. Sci., Vol. 5 (2003), pp. 23-59, see page 30.
Ira M. Gessel, On the Almkvist-Meurman Theorem for Bernoulli Polynomials, Integers (2023) Vol. 23, #A14.
J. W. L. Glaisher, On a set of coefficients analogous to the Eulerian numbers, Proc. London Math. Soc., Vol. 31 (1899), pp. 216-235.
René Gy, Bernoulli-Stirling Numbers, Integers, Vol. 20, (2020), #A67.
J. C. P. Miller, Letter to N. J. A. Sloane, Mar 26 1971.
N. J. A. Sloane, Transforms.
Wikipedia, Bernoulli Polynomials.
Index entries for sequences related to Glaisher's numbers

Cf. A083007, A033470.

read transforms; t1 := (3/2)/(1+exp(x)+exp(-x)); series(t1,x,50): t2 := SERIESTOLISTMULT(t1); [seq(n*t2[n],n=1..nops(t5))];

s[n_] := CoefficientList[Series[(1/2)*(Sin[t/2]/Sin[3*(t/2)]), {t, 0, 32}], t][[n + 1]]*n!*(-1)^Floor[n/2]; a[n_] := (-1)^n*(6*n + 3)*s[2*n]; Table[a[n], {n, 1, 16}] (* Jean-François Alcover, Mar 22 2011, after Michael Somos' formula *)
a[ n_] := If[ n < 1, 0, (2 n + 1)! SeriesCoefficient[ 3 / (2 + 4 Cos[x]), {x, 0, 2 n}]]; (* Michael Somos, Jun 01 2012 *)

{a(n) = if( n<1, 0, n*=2; (n+1)! * polcoeff( 3 / (2 + 4 * cos( x + O(x^n))), n))}; /* Michael Somos, Feb 26 2004 */

a(n)=if(n<1,0,-(-1)^n*sum(i=0,2*n,binomial(2*n+1,i)*bernfrac(i)*3^i)) \\ Benoit Cloitre, May 01 2002

def A002111(n):
    return add(add(add(((-1)^(n+1-v)/(j+1))*binomial(2*n+1,k)*binomial(j,v)*(3*v)^k for v in (0..j)) for j in (0..k)) for k in (0..2*n+1))
[A002111(n) for n in (1..16)]  # Peter Luschny, Jun 03 2013

To get these numbers, expand the e.g.f. (3/2)/(1+exp(x)+exp(-x)), multiply coefficient of x^n by (n+1)! and take absolute values.
Or expand the e.g.f. (3/2)/(1+2*cos(x)) and multiply coefficient of x^n by (n+1)!. - Herb Conn, Feb 25 2002
a(n) = (2n+1)*I(n), where I(n) is given by A047788/A047789.
a(n) = Sum_{i=0, 2n} B(i)*C(2n+1, i)*3^i where B(i) are the Bernoulli numbers, C(2n, i) the binomial numbers. - Benoit Cloitre, May 01 2002
a(n) = (-1)^n * (6*n + 3) * s(2*n), if n>0, where s(n) are the cubic Bernoulli numbers. - Michael Somos, Feb 26 2004
E.g.f.: 3*x / (2 + 4*cos(x)) = Sum_{n>=0} a(n) * x^(2*n+1) / (2*n+1)!. - Michael Somos, Feb 26 2004
E.g.f.: E(x) = (3/2)/(1+2*cos(x)) - 1/2 = x^2/(3*G(0)+x^2); G(k) = 2*(2*k+1)*(k+1) - x^2 + 2*x^2*(2*k+1)*(k+1)/G(k+1); (continued fraction Euler's kind, 1-step). Let f[n]:=coeftayl(E(x), x=0, n) then: A002111[n]=f[2*n+2]*((2*n+3)!). - Sergei N. Gladkovskii, Jan 14 2012
a(n) = Sum_{k=0..2n+1} Sum_{j=0..k} Sum_{v=0..j} ((-1)^(n-v+1)/(j+1))* binomial(2*n+1,k)*binomial(j,v)*(3*v)^k. - Peter Luschny, Jun 03 2013
a(n) ~ (2*n+1)! * sqrt(3) * (3/(2*Pi))^(2*n+1). - Vaclav Kotesovec, Jul 30 2013
From Peter Bala, Mar 02 2015: (Start)
a(n) = (-1)^(n+1)*3^(2*n+1)*B(2*n+1,1/3), where B(n,x) denotes the n-th Bernoulli polynomial. Cf. A009843, A069852, A069994.
Conjecturally, a(n) = the unsigned numerator of B(2*n+1,1/3). Cf. A033470.
Essentially a bisection of |A083007|.
G.f. for signed version of sequence: 1/2 + 1/2*Sum_{n >= 0} { 1/(n+1) * Sum_{k = 0..n} (-1)^(k+1)*binomial(n,k)/( (1 - (3*k + 1)*x)*(1 - (3*k + 2)*x) ) } = x^2 - 5*x^4 + 49*x^6 - .... (End)

A005799 Generalized Euler numbers of type 2^n.

Original entry on oeis.org

1, 1, 2, 10, 104, 1816, 47312, 1714000, 82285184, 5052370816, 386051862272, 35917232669440, 3996998043812864, 524203898507631616, 80011968856686405632, 14061403972845412526080, 2818858067801804443910144

Offset: 0

N. J. A. Sloane, Simon Plouffe

Also, a(n) equals the number of alternating permutations (p(1),...,p(2n)) of the multiset {1,1,2,2,...,n,n} satisfying p(1) <= p(2) > p(3) <= p(4) > p(5) <= ... <= p(2n). Hence, A275801(n) <= a(n) <= A275829(n). - Max Alekseyev, Aug 10 2016
This is the BinomialMean transform of A000364 (see A075271 for definition of transform). - John W. Layman, Dec 04 2002
This sequence appears to be middle column in Poupard's triangle A008301.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Peter Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
Shishuo Fu, Zhicong Lin, and Zhi-Wei Sun, Proof of several conjectures relating permanents to Combinatorial sequences, arXiv:2109.11506v3 [math.CO], 2021-2023.
Shishuo Fu, Zhicong Lin, and Zhi-Wei Sun, Permanent identities, combinatorial sequences, and permutation statistics, Advances in Applied Mathematics, Volume 163, Part A, 102789 (2025).
Ira M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A 53 (1990), no. 2, 257-285.
H. Prodinger, On Touchard's continued fraction and extensions: combinatorics-free, self-contained proofs , arXiv:1102.5186 [math.CO], 2011.
Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.

Right edge of triangle A210108.

Cf. A000364, A008301, A275801, A275829, A154283, A000657.

T := proc(n, k) option remember;
if n < 0 or k < 0 then 0
elif n = 0 then euler(k, 1)
else T(n-1, k+1) - T(n-1, k) fi end:
a := n -> (-2)^n*T(n, n); seq(a(n), n=0..16); # Peter Luschny, Aug 23 2017

a[n_] := Sum[Binomial[n, i]Abs[EulerE[2i]], {i, 0, n}]/2^n

a(n) = (1/2^n) * Sum_{i=0..n} binomial(n, i) * A000364(i).
From Sergei N. Gladkovskii, Dec 27 2012, Oct 11 2013, Oct 27 2013, Jan 08 2014: (Start) Continued fractions:
G.f.: A(x) = 1/G(0) where G(k) = 1 - x*(k+1)*(2*k+1)/(1 - x*(k+1)*(2*k+1)/G(k+1)).
G.f.: Q(0)/(1-x), where Q(k) = 1 - x^2*(k+1)^2*(2*k+1)^2/(x^2*(k+1)^2*(2*k+1)^2 - (4*x*k^2 + 2*x*k + x - 1)*( 4*x*k^2 + 10*x*k + 7*x - 1)/Q(k+1)).
G.f.: R(0), where R(k) = 1 - x*(2*k+1)*(k+1)/(x*(2*k+1)*(k+1) - 1/(1 - x*(2*k+1)*(k+1)/(x*(2*k+1)*(k+1) - 1/R(k+1)))).
G.f.: 2/(x*Q(0)), where Q(k) = 2/x - 1 - (2*k+1)^2/(1 - (2*k+2)^2/Q(k+1)). (End)
a(n) ~ 2^(3*n+3) * n^(2*n+1/2) / (exp(2*n) * Pi^(2*n+1/2)). - Vaclav Kotesovec, May 30 2015
a(n) = 2^n * Sum_{k=0..n} (-1)^k*binomial(n, k)*euler(n+k, 1). - Peter Luschny, Aug 23 2017
From Peter Bala, Dec 21 2019: (Start)
O.g.f. as a continued fraction: 1/(1 - x/(1 - x/(1 - 6*x/(1 - 6*x/(1 - 15*x/(1 - 15*x/(1 - ... - n*(2*n-1)*x/(1 - n*(2*n-1)*x/(1 - ...))))))))) - apply Bala, Proposition 3, with a = 0, b = 1 and replace x with x/2.
Conjectures:
E.g.f. as a continued fraction: 2/(2 - (1-exp(-4*t))/(2 - (1-exp(-8*t))/(2 - (1-exp(-12*t))/(2 - ... )))) = 1 + t + 2*t^2/2! + 10*t^3/3! + 104*t^4/4! + ....
Cf. A000657. [added April 18 2024: for a proof of this conjecture see Fu et al., Section 4.3.]
a(n) = (-2)^(n+1)*Sum_{k = 0..floor((n-1)/2)} binomial(n,2*k+1)*(2^(2*n-2*k) - 1)*Bernoulli(2*n-2*k)/(2*n-2*k) for n >= 1. (End)

Edited by Dean Hickerson, Dec 10 2002

A002438 Multiples of Euler numbers.

Original entry on oeis.org

1, 5, 205, 22265, 4544185, 1491632525, 718181418565, 476768795646785, 417370516232719345, 465849831125196593045, 645702241048404020542525, 1088120580608731523115639305, 2190881346273790815462670984105

Offset: 1

N. J. A. Sloane

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 75.
Glaisher, J. W. L.; Messenger of Math., 28 (1898), 36-79, see esp. p. 51.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 1..100
P. Bala, A triangle for calculating A002438
P. Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
Matthieu Josuat-Vergès and Jang Soo Kim, Touchard-Riordan formulas, T-fractions, and Jacobi's triple product identity, arXiv:1101.5608 [math.CO] (2011)

Cf. A000364, A086646, A255884.

a[n_] := (1+9^(n-1))*Abs[EulerE[2*(n-1)]]/2; Table[ a[n], {n, 1, 13}](* Jean-François Alcover, Feb 10 2012 *)

A002438(n)=A000364(n-1)*(9^(n-1)+1)\2 \\ - M. F. Hasler, Jul 21 2013

a(n) = A000364(n-1) * (9^(n-1) + 1)/2.
a(n+1) = Sum_{k = 0..n} A086646(n, k)*(-4)^k*9^(n-k). - Philippe Deléham, Aug 26 2005
From Peter Bala, Mar 13 2015: (Start)
a(n+1) = (-1)^n*6^(2*n)*E(2*n,1/6).
Assuming an offset of 0, the e.g.f. is cos(2*x)/cos(3*x) = 1 + 5*x + 205*x^2/2! + 22265*x^3/3! + 4544185*x^4/4! + ....
O.g.f. as a continued fraction: x/(1 - (3^2 - 2^2)*x/(1 - 6^2*x/(1 - (9^2 - 2^2)*x/(1 - 12^2*x/(1 - ... ))))) = x + 5*x^2 + 205*x^3 + 22265*x^4 + 4544185*x^5 + .... See Josuat-Vergès and Kim, p. 23. Cf. A086646.
The expansion of exp( Sum_{n >= 1} a(n+1)*x^n/n ) = exp( 5*x + 205*x^2/2 + 22265*x^3/3 + 4544185 *x^4/4 + ... ) appears to have integer coefficients. See A255884.
(End)
From Peter Bala, Nov 10 2015: (Start)
O.g.f. A(x) = 1/(1 + x - 6*x/(1 - 30*x/(1 + x - 84*x/(1 - 132*x/(1 + x - ... - 6*n*(6*n - 5)*x/(1 - 6*n*(6*n - 1)*x/(1 + x - ))))))).
A(x) = 1/(1 + 25*x - 30*x/(1 - 6*x/(1 + 25*x - 132*x/(1 - 84*x/(1 + 25*x - ... - 6*n*(6*n - 1)*x/(1 - 6*n*(6*n - 5)*x/(1 + 25*x - ))))))). (End)

More terms from Herman P. Robinson

More terms from Jon E. Schoenfield, May 09 2010

A208679 Kashaev's invariant for the (5,2)-torus knot (Solomon's seal knot).

Original entry on oeis.org

1, 71, 14641, 6242711, 4555133281, 5076970085351, 8024733763147921, 17074591123571719991, 47056485265721520250561, 163059403058191163396938631, 693897612604719894794535433201

Offset: 1

Peter Bala, Mar 01 2012

In general, Kashaev’s invariant for the (2*m+1,2)-torus knot has e.g.f. 1/2*sin(2*x)/cos((2*m+1)*x). Case m = 1 is A002439. For other examples see A208680 and A208681.
From Peter Bala, Dec 20 2021: (Start)
We make the following conjectures:
1) Taking the sequence modulo an integer k gives an eventually periodic sequence with period dividing phi(k). For example, the sequence taken modulo 9 begins [1, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, ...] with an apparent pre-period of length 1 and a period [8, 7, 5, 1, 2, 4] of length 6 = phi(9).
2) For i >= 0, define a_i(n) = a(n+i). Then for each i the Gauss congruences a_i(n*p^k) == a_i(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k. If true, then for each i the expansion of exp(Sum_{n >= 1} a_i(n)*x^n/n) has integer coefficients. (End)

Peter Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
K. Hikami, Volume Conjecture and Asymptotic Expansion of q-Series, Experimental Mathematics Vol. 12, Issue 3 (2003).

Cf. A002439 ((3,2)-torus knot), A208680, A208681, A208730, A208733, A057569.

Cf. A060096, A060097.

A208679 := proc(n) option remember; if n = 1 then 1; else (-4)^(n-1) - add((-25)^k*binomial(2*n-1,2*k)*procname(n-k),k=1..n) ; end if; end proc:
seq(A208679(n),n = 1..20) # Peter Bala, Dec 20 2021
A208679 := 5*10^(2*n-2)*(-1)^n*euler(2*n-1,3/10):
seq(A208679(n),n = 1..11); # Miles Wilson, Aug 05 2024

nmax = 20; Table[(CoefficientList[Series[1/2*Sin[2*x]/Cos[5*x], {x, 0, 2*nmax}], x] * Range[0, 2*nmax - 1]!)[[j]], {j, 2, 2*nmax + 1, 2}] (* Vaclav Kotesovec, Aug 30 2015 *)

my(x='x+O('x^30), v=Vec(serlaplace((1/2)*sin(2*x)/cos(5*x)))); vector(#v\2,n,v[2*n-1]) \\ Joerg Arndt, Aug 08 2024

E.g.f.: (1/2)*sin(2*x)/cos(5*x) = x + 71*x^3/3! + 14641*x^5/5! + ....
Define F(q) := Sum_{m,n >= 0} (q^(-m*n)*product {i = 1.. m+n} (1-q^i)). For the expansion of F(1-q) and F(exp(-t)) see A208733 and A208730 respectively. Kitami gives the conjectural e.g.f. exp(-9*t)*F(exp(-40*t)) = 1 + 71*t + 14641*t^2/2! + ....
a(n) = (-1)^n/(4*n+4)*20^(2*n+1)*Sum_{k = 1..20} X(k)*B(2*n+2,k/20), where B(n,x) is a Bernoulli polynomial and X(n) is a periodic function modulo 20 given by X(n) = 0 except for X(20*n+3) = X(20*n+17) = 1 and X(20*n+7) = X(20*n+13) = -1.
a(n) = 1/2*(-1)^(n+1)*L(-2*n-1,X) in terms of the associated L-series attached to the periodic arithmetical function X.
a(n) ~ (2*n-1)! * 2^(2*n-3/2) * 5^(2*n-1) * sqrt(5-sqrt(5)) / Pi^(2*n). - Vaclav Kotesovec, Aug 30 2015
From Peter Bala, May 11 2017: (Start)
Let X = 40*x. G.f. with offset 0: A(x) = 1 + 71*x + 14641*x^2 + ... = 1/(1 + 9*x - 2*X/(1 - 3*X/(1 + 9*x - 9*X/(1 - 11*X/(1 + 9*x - 21*X/(1 - 24*X/(1 + 9*x - ...))))))), where the sequence [2, 3, 9, 11, ..., n*(5*n - 1)/2, n*(5*n + 1)/2, ...] of unsigned coefficients in the partial numerators of the continued fraction is A057569.
A(x) = 1/(1 + 49*x - 3*X/(1 - 2*X/(1 + 49*x - 11*X/(1 - 9*X/(1 + 49*x - 24*X/(1 - 21*X/(1 + 49*x - 42*X/(1 - 38*X/(1 + 49*x - ...))))))))), where the sequence [3, 2, 11, 9, 24, 21, ...] of unsigned coefficients in the partial numerators of the continued fraction is obtained by swapping pairs of adjacent terms of A057569. Let B(x) = 1/(1 - 9*x)*A(x/(1 - 9*x)), that is, B(x) is the 9_th binomial transform of A(x). Then B(x/40) = 1 + 2*x + 10*x^2 + 104*x^3 + ... is the o.g.f. for A208730. (End)
From Peter Bala, Dec 20 2021: (Start)
a(1) = 1, a(n) = (-4)^(n-1) - Sum_{k = 1..n} (-25)^k*C(2*n-1,2*k)*a(n-k).
a(n) == 71^(n-1) ( mod (2^7)*3*(5^2) ). (End)
a(n) = 5*10^(2*n - 2)*(-1)^n*E(2*n - 1, 3/10), where E(n,x) is the n-th Euler polynomial in x (A060096/A060097). - Miles Wilson, Aug 05 2024

A208681 Kashaev's invariant for the (9,2)-torus knot.

Original entry on oeis.org

1, 239, 160801, 222359759, 525750911041, 1898604115708079, 9723130520022672481, 67030256200148854573199, 598528825179130480174293121, 6719801498668147110144664875119, 92651189588518508157161032926540961

Offset: 1

Peter Bala, Mar 01 2012

Compare with A156652. For other Kashaev invariants see A002439, A208679 and A208680.
From Peter Bala, Dec 25 2021: (Start)
We make the following conjectures:
1) Taking the sequence modulo an integer k gives an eventually periodic sequence with period dividing phi(k). For example, the sequence taken modulo 21 begins [1, 8, 4, 20, 13, 17, 1, 8, 4, 20, 13, 17, 1, 8, 4, 20, 13, 17, ...], which appears to be a purely periodic sequence with period 6 = (1/2)*phi(21).
2) For i >= 0, define a_i(n) = a(n+i). Then for each i the Gauss congruences a_i(n*p^k) == a_i(n*p^(k-1)) ( mod p^k ) hold for all prime p and positive integers n and k. If true, then for each i the expansion of exp(Sum_{n >= 1} a_i(n)*x^n/n) has integer coefficients. (End)

Peter Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
K. Hikami, Volume Conjecture and Asymptotic Expansion of q-Series, Experimental Mathematics Vol. 12, Issue 3 (2003).

Cf. A002439 ((3,2)-torus knot), A156652, A208679, A208680.

A208681 := proc(n) option remember; if n = 1 then 1; else (-4)^(n-1) - add((-81)^k*binomial(2*n-1,2*k)*procname(n-k),k=1..n) ; end if; end proc:
seq(A208681(n),n = 1..20) # Peter Bala, Dec 25 2021

a[n_] := (2n-1)! SeriesCoefficient[(1/2)(Sin[2x]/ Cos[9x]), {x, 0, 2n-1}];
Table[a[n], {n, 1, 11}] (* Jean-François Alcover, Sep 23 2022 *)

E.g.f.: 1/2*sin(2*x)/cos(9*x) = x + 239*x^3/3! + 160801*x^5/5! + ....
a(n) = (-1)^n/(4*n+4)*36^(2*n+1)*sum {k = 1..36} X(k)*B(2*n+2,k/36), where B(n,x) is a Bernoulli polynomial and X(n) is a periodic function modulo 36 given by X(n) = 0 except for X(36*n+7) = X(36*n+29) = 1 and X(36*n+11) = X(36*n+25) = -1.
a(n) = 1/2*(-1)^(n+1)*L(-2*n-1,X) in terms of the associated L-series attached to the periodic arithmetical function X.
From Peter Bala, May 16 2017: (Start)
O.g.f. (with offset 0) as continued fraction: A(x) = 1/(1 + 49*x - 8*36*x/(1 - 10*36*x/(1 + 49*x -...- n*(9*n-1)*36*x/(1 - n*(9*n+1)*36*x/(1 + 49*x - ... ))))).
Also,  A(x) = 1/(1 + 121*x - 10*36*x/(1 - 8*36*x/(1 + 121*x -...- n*(9*n+1)*36*x/(1 - n*(9*n-1)*36*x/(1 + 121*x - ... ))))). (End)
a(n) ~ sin(Pi/9) * 2^(4*n) * 3^(4*n-2) * n^(2*n-1/2) / (Pi^(2*n-1/2) * exp(2*n)). - Vaclav Kotesovec, May 18 2017
From Peter Bala, Dec 25 2021: (Start)
a(1) = 1, a(n) = (-4)^(n-1) - Sum_{k = 1..n} (-81)^k*C(2*n-1,2*k)*a(n-k).
a(n) == 239^(n-1) mod ( (2^8)*(3^4)*5 ). (End)

cp's OEIS Frontend

A158690 Expansion of the basic hypergeometric series 1 + (1 - exp(-t)) + (1 - exp(-t))*(1 - exp(-3*t)) + (1 - exp(-t))*(1 - exp(-3*t))*(1 - exp(-5*t)) + ... as a series in t.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A000191 Generalized tangent numbers d(3, n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A079144 Number of labeled interval orders on n elements: (2+2)-free posets.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A002437 a(n) = A000364(n) * (3^(2*n+1) + 1)/4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A000498 Eulerian numbers (Euler's triangle: column k=4 of A008292, column k=3 of A173018).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A002111 Glaisher's G numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A158690 Expansion of the basic hypergeometric series 1 + (1 - exp(-t)) + (1 - exp(-t))(1 - exp(-3t)) + (1 - exp(-t))(1 - exp(-3t))(1 - exp(-5t)) + ... as a series in t.