A002437 -id:A002437 - cp's OEIS frontend

A002439 Glaisher's T numbers.

1, 23, 1681, 257543, 67637281, 27138236663, 15442193173681, 11828536957233383, 11735529528739490881, 14639678925928297567703, 22427641105413135505628881, 41393949926819051111431239623, 90592214447886493688036507587681, 231969423543894989257690172433129143

Offset: 0

N. J. A. Sloane

Kashaev's invariant for the (3,2)-torus knot. See Hikami 2003. For other Kashaev invariants see A208679, A208680, and A208681. - Peter Bala, Mar 01 2012
From Peter Bala, Dec 18 2021: (Start)
Glaisher's T numbers occur in the evaluation of the L-function L(X_12,s) := Sum_{k >= 1} X_12(k)/k^s for positive even values of s, where X_12(n) = A110161(n) is a nonprincipal Dirichlet character mod 12: the result is L(X_12,2*n+2) = a(n)/(6*sqrt(3)*36^n*(2*n+1)!) * Pi^(2*n+2).
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 50 begins [1, 23, 31, 43, 31, 13, 31, 33, 31, 3, 31, 23, 31, 43, 31, 13, 31, 33, 31, 3, 31, 23, ...] and appears to have a pre-period of length 1 and a period of length 10 = (1/2)*phi(50).
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.
3)(i)   a(m*n) == a(m)^n (mod 2^k) for k = 2*v_2(m) + 7, where v_p(i) denotes the p-adic valuation of i.
  (ii)  a(m*n) == a(m)^n (mod 3^k) for k = 2*v_3(m) + 2.
4)(i)   a(2*m*n) == a(n)^(2*m) (mod 2^k) for k = v_2(m) + 7
  (ii)  a((2*m+1)*n) == a(n)^(2*m+1) (mod 2^k) for k = v_2(m) + 7.
5)(i)   a(3*m*n) == a(n)^(3*m) (mod 3^k) for k = v_3(m) + 2
  (ii)  a((3*m+1)*n) == a(n)^(3*m+1) (mod 3^k) for k = v_3(m) + 2
  (iii) a((3*m+2)*n) == a(n)^(3*m+2) (mod 3^2).
6) For prime p >= 5, a((p-1)/2*n*m) == a((p-1)/2*n)^m (mod p^k) for k = v_p(m-1) + 1. (End)

			G.f. = 1 + 23*x + 1681*x^2 +257543*x^3 + 67637281*x^4 + 27138236663*x^5 + ...

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.
J. W. L. Glaisher, Messenger of Math., 28 (1898), 36-79, see esp. p. 76.
J. W. L. Glaisher, On the Bernoullian function, Q. J. Pure Appl. Math., 29 (1898), 1-168.
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=0..100
G. E. Andrews, J. Jimenez-Urroz and K. Ono, q-series identities and values of certain L-functions, Duke Math J., Volume 108, No.3 (2001), 395-419.
Peter Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
J. Bryson, K. Ono, S. Pitman and R. C. Rhoades, Unimodal Sequences and Quantum and Mock Modular Forms, P. 2.
Frank Garvan, Congruences and relations for r-Fishburn numbers, arXiv:1406.5611 [math.NT], 2014.
J. W. L. Glaisher, On a set of coefficients analogous to the Eulerian numbers, Proc. London Math. Soc., 31 (1899), 216-235.
K. Hikami, Volume Conjecture and Asymptotic Expansion of q-Series, Experimental Mathematics Vol. 12, Issue 3 (2003).
Michael E. Hoffman, Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences, The Electronic Journal of Combinatorics, Volume 6.1 (1999): Research paper R21, 13 p.
Hsien-Kuei Hwang and Emma Yu Jin, Asymptotics and statistics on Fishburn matrices and their generalizations, arXiv:1911.06690 [math.CO], 2019.
J. C. P. Miller, Letter to N. J. A. Sloane, Mar 26 1971
Hjalmar Rosengren, Elliptic pfaffians and solvable lattice models, arXiv preprint arXiv:1605.02915 [math-ph], 2016.
A. Vieru, Agoh's conjecture: its proof, its generalizations, its analogues, arXiv preprint arXiv:1107.2938 [math.NT], 2011.
Don Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta-function, Topology, vol.40, pp.945-960 (2001).
Index entries for sequences related to Glaisher's numbers

Cf. A000364, A000464, A002105, A079144, A158690.
Bisections: A156175, A156176.
Twice this sequence gives A000191. A208679, A208680, A208681.

m:=32; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!( Sin(2*x)/(2*Cos(3*x)) )); [Factorial(2*n-1)*b[2*n-1]: n in [1..Floor((m-2)/2)]]; // G. C. Greubel, Jul 04 2019

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:

a[n_] := a[n] = (-4)^n - Sum[(-9)^k*Binomial[2n + 1, 2k]*a[n-k], {k, 1, n}]; a[0] = 1; Table[a[n], {n, 0, 11}] (* Jean-François Alcover, Dec 05 2011, after Maple *)
With[{nn=30},Take[CoefficientList[Series[Sin[2x]/(2Cos[3x]),{x,0,nn}], x]Range[0,nn-1]!,{2,-1,2}]] (* Harvey P. Dale, Feb 05 2012 *)
a[n_] := -(-4)^n 3^(1 + 2 n) EulerE[1 + 2 n, 1/6]  (* Bill Gosper, Oct 12 2015 *)

{a(n) = my(m=n+1); if( m<2, m>0, (-4)^(m-1) - sum(k=1, m, (-9)^k * binomial(2*m-1, 2*k) * a(n-k)))}; /* Michael Somos, Dec 11 1999 */

m = 32; T = taylor(sin(2*x)/(2*cos(3*x)), x, 0, m); [factorial(2*n+1)*T.coefficient(x, 2*n+1) for n in (0..(m-2)/2)] # G. C. Greubel, Jul 04 2019

Q_{2n+1}(sqrt(3))/sqrt(3), where the polynomials Q_n() are defined in A104035. - N. J. A. Sloane, Nov 06 2009
E.g.f.: sin(2*x)/(2*cos(3*x)) = Sum a(n)*x^(2*n+1)/(2*n+1)!.
With offset 1 instead of 0: a(1)=1, a(n)=(-4)^(n-1) - Sum_{k=1..n} (-9)^k*C(2*n-1, 2*k)*a(n-k).
a(n) = -(-4)^n*3^(2n+1)*E_{2n+1}(1/6), where E is an Euler polynomial. - Bill Gosper, Aug 08 2001, corrected Oct 12 2015.
From Peter Bala, Mar 24 2009: (Start)
Basic hypergeometric generating function: exp(-t)*Sum {n = 0..inf} Product {k = 1..n} (1-exp(-24*k*t)) = 1 + 23*t + 1681*t^2/2! + .... For other sequences with generating functions of a similar type see A000364, A000464, A002105, A079144, A158690.
a(n) = (1/2)*(-1)^(n+1)*L(-2*n-1), where L(s) is a Dirichlet L-function for a Dirichlet character with modulus 12: L(s) = 1 - 1/5^s - 1/7^s + 1/11^s + - - + .... See the Andrew's link. (End)
From Peter Bala, Jan 21 2011: (Start)
Let I = sqrt(-1) and w = exp(2*Pi*I/6). Then
a(n) = I/sqrt(3) *sum {k = 0..2*n+2} w^(n-k) *sum {j = 1..2*n+2} (-1)^(k-j) *binomial(2*n+2,k-j) *(2*j-1)^(2*n+1).
This formula can be used to obtain congruences for a(n). For example, for odd prime p we find a(p-1) = 1 (mod p) and a((p-1)/2) = (-1)^((p-1)/2) (mod p).
Cf. A002437 and A182825. (End)
a(n) = (-1)^n/(4*n+4)*12^(2*n+1)*sum {k = 1..12} X(k)*B(2*n+2,k/12), where B(n,x) is a Bernoulli polynomial and X(n) is a periodic function modulo 12 given by X(n) = 0 except for X(12*n+1) = X(12*n+11) = 1 and X(12*n+5) = X(12*n+7) = -1. - Peter Bala, Mar 01 2012
a(n) ~ n^(2*n+3/2) * 2^(4*n+3) * 3^(2*n+3/2) / (exp(2*n) * Pi^(2*n+3/2)). - Vaclav Kotesovec, Mar 01 2014
From Peter Bala, May 11 2017: (Start)
Let X = 24*x. G.f. A(x) = 1/(1 + x - X/(1 - 2*X/(1 + x - 5*X/(1 - 7*X/(1 + x - 12*X/(1 - ...)))))) = 1 + 23*x + 1681*x^2 + ..., where the sequence [1, 2, 5, 7, 12, ...] of unsigned coefficients in the partial numerators of the continued fraction are generalized pentagonal numbers A001318.
A(x) = 1/(1 + 25*x - 2*X/(1 - X/(1 + 25*x - 7*X/(1 - 5*X/(1 + 25*x - 15*X/(1 - 12*X/(1 + 25*x - 26*X/(1 - 22*X/(1 + 25*x - ...))))))))), where the sequence [2, 1, 7, 5, 15, 12, 26, 22, ...] of unsigned coefficients in the partial numerators is obtained by swapping pairs of adjacent generalized pentagonal numbers.
G.f. as a J-fraction: A(x) = 1/(1 - 23*x - 2*X^2/(1 - 167*x - 5*7*X^2/(1 - 455*x - 12*15*X^2/(1 - 887*x - ...)))).
Let B(x) = 1/(1 - x)*A(x/(1 - x)), that is, B(x) is the binomial transform of A(x). Then B(x/24) is the o.g.f. for A079144. (End)
a(n) == 23^n ( mod (2^7)*(3^2) ). - Peter Bala, Dec 25 2021

More terms from Michael Somos

Offset changed from 1 to 0 by N. J. A. Sloane, Dec 11 1999

A092731 Decimal expansion of Pi^5.

Original entry on oeis.org

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

Offset: 3

Mohammad K. Azarian, Apr 12 2004

			306.0196847852814532

G. C. Greubel, Table of n, a(n) for n = 3..10000
Jean-Christophe Pain, The fifth power of Pi: new series representation involving the golden ratio and an application in physics, 2022.
Jean-Christophe Pain, New series representations for any positive power of Pi from a relation involving trigonometric functions, 2208.02624 [math.NT], 2022.
Kh. Hessami Pilehrood and Tatiana Hessami Pilehrood, Series acceleration formulas for beta values, Discr. Math. Theor. Comp. Sci. 12 (2) (2010) 223-236.
Index entries for transcendental numbers

Cf. A000796, A002161, A019692, A091925, A092735, A000364, A002437.

R:= RealField(100); (Pi(R))^5; // G. C. Greubel, Mar 09 2018

RealDigits[Pi^5, 10, 100][[1]] (* G. C. Greubel, Mar 09 2018 *)

PARI
```
Pi^5 \\ G. C. Greubel, Mar 09 2018
```

From Peter Bala, Oct 31 2019: (Start)
Pi^5 = (4!/(2*305)) * Sum_{n >= 0} (-1)^n*( 1/(n + 1/6)^5 + 1/(n + 5/6)^5 ), where 305 = ((3^5 + 1)/4)*A000364(2) = A002437(2).
Pi^5 = (4!/(2*3905)) * Sum_{n >= 0} (-1)^n*( 1/(n + 1/10)^5 - 1/(n + 3/10)^5 - 1/(n + 7/10)^5 + 1/(n + 9/10)^5 ), where 3905 = ((5^5 - 1)/4)*A000364(2).
Cf. A019692, A091925 and A092735. (End)

A104035 Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(0,0) = 1; T(0,k) = 0 if k>0 or if k<0; T(n,k) = kT(n-1,k-1) + (k+1)T(n-1,k+1).

Original entry on oeis.org

1, 0, 1, 1, 0, 2, 0, 5, 0, 6, 5, 0, 28, 0, 24, 0, 61, 0, 180, 0, 120, 61, 0, 662, 0, 1320, 0, 720, 0, 1385, 0, 7266, 0, 10920, 0, 5040, 1385, 0, 24568, 0, 83664, 0, 100800, 0, 40320, 0, 50521, 0, 408360, 0, 1023120, 0, 1028160, 0, 362880, 50521, 0, 1326122, 0, 6749040

Offset: 0

Philippe Deléham, Apr 06 2005

Or, triangle of coefficients (with exponents in increasing order) in polynomials Q_n(u) defined by d^n sec x / dx^n = Q_n(tan x)*sec x.
Interpolates between factorials and Euler (or secant) numbers. Related to Springer numbers.
Companion triangles are A155100 (derivative polynomials of tangent function) and A185896 (derivative polynomials of squared secant function).
A combinatorial interpretation for the polynomial Q_n(u) as the generating function for a sign change statistic on certain types of signed permutation can be found in [Verges]. A signed permutation is a sequence (x_1,x_2,...,x_n) of integers such that {|x_1|,|x_2|,...,|x_n|} = {1,2,...,n}. They form a group, the hyperoctahedral group of order 2^n*n! = A000165(n), isomorphic to the group of symmetries of the n dimensional cube.
Let x_1,...,x_n be a signed permutation. Adjoin x_0 = 0 to the front of the permutation and x_(n+1) = (-1)^n*(n+1) to the end to form x_0,x_1,...,x_n,x_(n+1). Then x_0,x_1,...,x_n,x_(n+1) is a snake of type S(n;0) when x_0 < x_1 > x_2 < ... x_(n+1). For example, 0 3 -1  2 -4 is a snake of type S(3;0).
Let sc be the number of sign changes through a snake ... sc = #{i, 0 <= i <= n, x_i*x_(i+1) < 0}. For example, the snake 0 3 -1 2 -4 has sc = 3. The polynomial Q_n(u) is the generating function for the sign change statistic on snakes of type S(n;0): ... Q_n(u) = sum {snakes in S(n;0)} u^sc. See the example section below for the cases n = 2 and n = 3.
PRODUCTION MATRIX
Let D = subdiag(1,2,3,...) be the array with the indicated sequence on the first subdiagonal and zeros elsewhere and let C = transpose(D). The production matrix for this triangle is C+D: the first row of (C+D)^n is the n-th row of this triangle. D represents the derivative operator d/dx and C represents the operator p(x) -> x*d/dx(x*p(x)) acting on the basis monomials {x^n}n>=0. See Formula (1) below.

			The polynomials Q_0(u) through Q_6(u) (with exponents in decreasing order) are:
  1
  u
  2*u^2 + 1
  6*u^3 + 5*u
  24*u^4 + 28*u^2 + 5
  120*u^5 + 180*u^3 + 61*u
  720*u^6 + 1320*u^4 + 662*u^2 + 61
Triangle begins:
  1
  0 1
  1 0 2
  0 5 0 6
  5 0 28 0 24
  0 61 0 180 0 120
  61 0 662 0 1320 0 720
  0 1385 0 7266 0 10920 0 5040
  1385 0 24568 0 83664 0 100800 0 40320
  0 50521 0 408360 0 1023120 0 1028160 0 362880
  50521 0 1326122 0 6749040 0 13335840 0 11491200 0 3628800
  0 2702765 0 30974526 0 113760240 0 185280480 0 139708800 0 39916800
  2702765 0 98329108 0 692699304 0 1979524800 0 2739623040 0 1836172800 0 479001600
Examples of sign change statistic sc on snakes of type S(n;0)
= = = = = = = = = = = = = = = = = = = = = =
.....Snakes....# sign changes sc.......u^sc
= = = = = = = = = = = = = = = = = = = = = =
n=2
...0 1 -2 3...........2.................u^2
...0 2  1 3...........0.................1
...0 2 -1 3...........2.................u^2
yields Q_2(u) = 2*u^2 + 1.
n=3
...0 1 -2  3 -4.......3.................u^3
...0 1 -3  2 -4.......3.................u^3
...0 1 -3 -2 -4.......1.................u
...0 2  1  3 -4.......1.................u
...0 2 -1  3 -4.......3.................u^3
...0 2 -3  1 -4.......3.................u^3
...0 2 -3 -2 -4.......1.................u
...0 3  1  2 -4.......1.................u
...0 3 -1  2 -4.......3.................u^3
...0 3 -2  1 -4.......3.................u^3
...0 3 -2 -1 -4.......1.................u
yields Q_3(u) = 6*u^3 + 5*u.

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 2nd ed. 1998, p. 287.
S. Mukai, An Introduction to Invariants and Moduli, Cambridge, 2003; see pp. 445 and 469.

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened
K. Boyadzhiev, Derivative Polynomials for tanh, tan, sech and sec in Explicit Form, arXiv:0903.0117 [math.CA], 2009-2010.
M.-P. Grosset and A. P. Veselov, Bernoulli numbers and solitons, arXiv:math/0503175 [math.GM], 2005.
Gordon Haigh, A "natural" approach to Pick's theorem, Math. Gaz. 64 (1980), no. 429, 173-180.
Michael E. Hoffman, Derivative polynomials for tangent and secant, Amer. Math. Monthly, 102 (1995), 23-30.
Michael E. Hoffman, Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences, The Electronic Journal of Combinatorics, Volume 6.1 (1999): Research paper R21, 13 p.
M. Josuat-Vergès, Enumeration of snakes and cycle-alternating permutations, arXiv:1011.0929 [math.CO], 2010.
Donald E. Knuth and Thomas J. Buckholtz, Computation of tangent, Euler and Bernoulli numbers, Math. Comp. 21 1967 663-688.

See A008294 for another version of this triangle.
Setting u=0,1,2,3,4 gives A000364, A001586, A156129, A156131, A156132.
Setting u=sqrt(2) gives A156134 and A156138; u=sqrt(3) gives A002437 and A002439.
Cf. A060187, A155100, A185896, A186492.

a104035 n k = a104035_tabl !! n !! k
a104035_row n = a104035_tabl !! n
a104035_tabl = iterate f [1] where
   f xs = zipWith (+)
     (zipWith (*) [1..] (tail xs) ++ [0,0]) ([0] ++ zipWith (*) [1..] xs)
-- Reinhard Zumkeller, Apr 27 2014

nmax = 10; t[n_, k_] := t[n, k] = k*t[n-1, k-1] + (k+1)*t[n-1, k+1]; t[0, 0] = 1; t[0, ] = 0; Flatten[ Table[t[n, k], {n, 0, nmax}, {k, 0, n}]] (* _Jean-François Alcover, Nov 14 2011 *)

T(n, n) = n!; T(n, 0) = 0 if n = 2m + 1; T(n, 0) = A000364(m) if n = 2m.
Sum_{k>=0} T(m, k)*T(n, k) = T(m+n, 0).
Sum_{k>=0} T(n, k) = A001586(n): Springer numbers.
G.f.: Sum_{n >= 0} Q_n(u)*t^n/n! = 1/(cos t - u sin t).
From Peter Bala: (Start)
RECURRENCE RELATION
For n>=0,
(1)... Q_(n+1)(u) = d/du Q_n(u) + u*d/du(u*Q_n(u))
... = (1+u^2)*d/du Q_n(u) + u*Q_n(u),
with starting condition Q_0(u) = 1. Compare with Formula (4) of A186492.
RELATION WITH TYPE B EULERIAN NUMBERS
(2)... Q_n(u) = ((u+i)/2)^n*B(n,(u-i)/(u+i)), where i = sqrt(-1) and
[B(n,u)]n>=0 = [1,1+u,1+6*u+u^2,1+23*u+23*u^2+u^3,...] is the sequence of type B Eulerian polynomials (with a factor of u removed) - see A060187.
(End)
T(n,0) = abs(A122045(n)). - Reinhard Zumkeller, Apr 27 2014

Entry revised by N. J. A. Sloane, Nov 06 2009

A000281 Expansion of cos(x)/cos(2x).

Original entry on oeis.org

1, 3, 57, 2763, 250737, 36581523, 7828053417, 2309644635483, 898621108880097, 445777636063460643, 274613643571568682777, 205676334188681975553003, 184053312545818735778213457, 193944394596325636374396208563

Offset: 0

N. J. A. Sloane

a(n) is (2n)! times the coefficient of x^(2n) in the Taylor series for cos(x)/cos(2x).

			cos x / cos 2*x = 1 + 3*x^2/2 + 19*x^4/8 + 307*x^6/80 + ...

J. W. L. Glaisher, "On the coefficients in the expansions of cos x / cos 2x and sin x / cos 2x", Quart. J. Pure and Applied Math., 45 (1914), 187-222.
I. J. Schwatt, Intro. to Operations with Series, Chelsea, p. 278.
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).

G. C. Greubel, Table of n, a(n) for n = 0..215 (terms 0..50 from T. D. Noe)
P. Bala, A triangle for calculating A000281
P. Bala, Some S-fractions related to the expansions of sin(ax)/cos(bx) and cos(ax)/cos(bx)
Kwang-Wu Chen, An Interesting Lemma for Regular C-fractions, J. Integer Seqs., Vol. 6, 2003.
D. Dumont, Further triangles of Seidel-Arnold type and continued fractions related to Euler and Springer numbers, Adv. Appl. Math., 16 (1995), 275-296.
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).
D. Shanks, Generalized Euler and class numbers. Math. Comp. 21 (1967) 689-694, sequence c(2,n).
D. Shanks, Corrigenda to: "Generalized Euler and class numbers", Math. Comp. 22 (1968), 699.
D. Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967), 689-694; 22 (1968), 699. [Annotated scanned copy]

Cf. A000364 A086646, A002437.
Cf. A064069. Bisection of A000825, A001586.
Cf. A098432. Cf. A093954, A188458, A212435, A235605, A255883.

a := n -> (-1)^n*2^(6*n+1)*(Zeta(0,-2*n,1/8)-Zeta(0,-2*n,5/8)):
seq(a(n), n=0..13); # Peter Luschny, Mar 11 2015

With[{nn=30},Take[CoefficientList[Series[Cos[x]/Cos[2x],{x,0,nn}],x] Range[0,nn]!,{1,-1,2}]] (* Harvey P. Dale, Oct 06 2011 *)

{a(n) = if( n<0, 0, n*=2; n! * polcoeff( cos(x + x * O(x^n)) / cos(2*x + x * O(x^n)), n))}; /* Michael Somos, Feb 09 2006 */

a(n) = Sum_{k=0..n} (-1)^k*binomial(2n, 2k)*A000364(n-k)*4^(n-k). - Philippe Deléham, Jan 26 2004
E.g.f.: Sum_{k>=0} a(k)x^(2k)/(2k)! = cos(x)/cos(2x).
a(n-1) is approximately 2^(4*n-3)*(2*n-1)!*sqrt(2)/((Pi^(2*n-1))*(2*n-1)). The approximation is quite good a(250) is of the order of 10^1181 and this formula is accurate to 238 digits. - Simon Plouffe, Jan 31 2007
G.f.: 1 / (1 - 1*3*x / (1 - 4*4*x / (1 - 5*7*x / (1 - 8*8*x / (1 - 9*11*x / ... ))))). - Michael Somos, May 12 2012
G.f.: 1/E(0) where E(k) = 1 - 3*x - 16*x*k*(2*k+1) - 16*x^2*(k+1)^2*(4*k+1)*(4*k+3)/E(k+1) (continued fraction, 1-step). - Sergei N. Gladkovskii, Sep 17 2012
G.f.: T(0)/(1-3*x), where T(k) = 1 - 16*x^2*(4*k+1)*(4*k+3)*(k+1)^2/( 16*x^2*(4*k+1)*(4*k+3)*(k+1)^2 - (32*x*k^2+16*x*k+3*x-1 )*(32*x*k^2+80*x*k+51*x -1)/T(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Oct 11 2013
From Peter Bala, Mar 09 2015: (Start)
a(n) = (-1)^n*4^(2*n)*E(2*n,1/4), where E(n,x) denotes the n-th Euler polynomial.
O.g.f.: Sum_{n >= 0} 1/2^n * Sum_{k = 0..n} (-1)^k*binomial(n,k)/(1 + x*(4*k + 1)^2) = 1 + 3*x + 57*x^2 + 2763*x^3 + ....
We appear to have the asymptotic expansion Pi/(2*sqrt(2)) - Sum {k = 0..n - 1} (-1)^floor(k/2)/(2*k + 1) ~ 1/(2*n) - 3/(2*n)^3 + 57/(2*n)^5 - 2763/(2*n)^7 + .... See A093954.
Bisection of A001586. See also A188458 and A212435. Second row of A235605 (read as a square array).
The expansion of exp( Sum_{n >= 1} a(n)*x^n/n ) appears to have integer coefficients. See A255883. (End)
From Peter Luschny, Mar 11 2015: (Start)
a(n) = ((-64)^n/((n+1/2)))*(B(2*n+1,7/8)-B(2*n+1,3/8)), B(n,x) Bernoulli polynomials.
a(n) = 2*(-16)^n*LerchPhi(-1, -2*n, 1/4).
a(n) = (-1)^n*Sum_{0..2*n} 2^k*C(2*n,k)*E(k), E(n) the Euler secant numbers A122045.
a(n) = (-4)^n*SKP(2*n,1/2) where SKP are the Swiss-Knife polynomials A153641.
a(n) = (-1)^n*2^(6*n+1)*(Zeta(-2*n,1/8) - Zeta(-2*n,5/8)), where Zeta(a,z) is the generalized Riemann zeta function. (End)
From Peter Bala, May 13 2017: (Start)
G.f.: 1/(1 + x - 4*x/(1 - 12*x/(1 + x - 40*x/(1 - 56*x/(1 + x - ... - 4*n(4*n - 3)*x/(1 - 4*n(4*n - 1)*x/(1 + x - ...
G.f.: 1/(1 + 9*x - 12*x/(1 - 4*x/(1 + 9*x - 56*x/(1 - 40*x/(1 + 9*x - ... - 4*n(4*n - 1)*x/(1 - 4*n(4*n - 3)*x/(1 + 9*x - .... (End)
From Peter Bala, Nov 08 2019: (Start)
a(n) = sqrt(2)*4^n*Integral_{x = 0..inf} x^(2*n)*cosh(Pi*x/2)/cosh(Pi*x) dx. Cf. A002437.
The L-series 1 + 1/3^(2*n+1) - 1/5^(2*n+1) - 1/7^(2*n+1) + + - - ... = sqrt(2)*(Pi/4)^(2*n+1)*a(n)/(2*n)! (see Shanks), which gives a(n) ~ (1/sqrt(2))*(2*n)!*(4/Pi)^(2*n+1). (End)

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

A092735 Decimal expansion of Pi^7.

Original entry on oeis.org

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

Offset: 4

Mohammad K. Azarian, Apr 12 2004

Wentworth (1903) shows how to compute the tangent of 15 degrees (A019913) to five decimal places by the laborious process of adding up the first few terms of Pi/12 + Pi^3/5184 + 2Pi^5/3732480 + 17Pi^7/11287019520 + ... - Alonso del Arte, Mar 13 2015

			3020.293227776792067514206493...

George Albert Wentworth, New Plane and Spherical Trigonometry, Surveying, and Navigation. Boston: The Atheneum Press (1903): 240.

G. C. Greubel, Table of n, a(n) for n = 4..10000
Index entries for transcendental numbers

Cf. A000796, A002161, A019692, A091925, A092731, A000364, A002437.

R:= RealField(100); (Pi(R))^7; // G. C. Greubel, Mar 09 2018

RealDigits[Pi^7, 10, 100][[1]] (* Alonso del Arte, Mar 13 2015 *)

PARI
```
Pi^7 \\ G. C. Greubel, Mar 09 2018
```

From Peter Bala, Oct 30 2019: (Start)
Pi^7 = (6!/(2*33367)) * Sum_{n >= 0} (-1)^n*( 1/(n + 1/6)^7 + 1/(n + 5/6)^7 ), where 33367 = ((3^7 + 1)/4)*A000364(3) = A002437(3).
Pi^7 = (6!/(2*1191391)) * Sum_{n >= 0} (-1)^n*( 1/(n + 1/10)^7 - 1/(n + 3/10)^7 - 1/(n + 7/10)^7 + 1/(n + 9/10)^7 ), where 1191391 = ((5^7 - 1)/4)*A000364(3). (End)

A012494 Expansion of e.g.f. arctan(sin(x)) (odd powers only).

Original entry on oeis.org

1, -3, 45, -1743, 125625, -14554683, 2473184805, -579439207623, 179018972217585, -70518070842040563, 34495620120141463965, -20515677772241956573503, 14578232896601243652363945, -12198268199871431840616166443, 11871344562637111570703016357525

Offset: 0

Patrick Demichel (patrick.demichel(AT)hp.com)

arctan(sin(x)) = x - 3*x^3/3! + 45*x^5/5! - 1743*x^7/7! + 125625*x^9/9! + ....
Absolute values are coefficients in expansion of
arctanh(arcsinh(x)) = x + 3*x^3/3! + 45*x^5/5! + 1743*x^7/7! + ....
arccot(sin(x)) = Pi/2 - x + 3*x^3/3! - 45*x^5/5! + 1743*x^7/7! - ....

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

Bisection of A003704, A013208.
Cf. A101923, A001209, A000364, A000281, A156134, A002437.
Cf. other sequences with a g.f. of the form cos(x)/(1 - k*sin^2(x)): A000364 (k=1), A001209 (k=1/2), A000281 (k=2), A156134 (k=3), A002437 (k=4).

a:= n-> (t-> t!*coeff(series(arctan(sin(x)), x, t+1), x, t))(2*n+1):
seq(a(n), n=0..20);  # Alois P. Heinz, Aug 16 2018

Drop[ Range[0, 25]! CoefficientList[ Series[ ArcTan[ Sin[x]], {x, 0, 25}], x], {1, 25, 2}] (* Or *)
f[n_] := n!Sum[(1 + (-1)^(n - 2k + 1))2^(1 - 2k)Sum[(-1)^((n + 1)/2 - j)Binomial[2k - 1, j]((2j - 2k + 1)^n/n!)/(2k - 1), {j, 0, (2k - 1)/2}], {k, Ceiling[n/2]}]; Table[ f[n], {n, 1, 25, 2}] (* Robert G. Wilson v *)

a(n):=n!*sum((1+(-1)^(n-2*k+1))*2^(1-2*k)*sum((-1)^((n+1)/2-i)*binomial(2*k-1,i)*(2*i-2*k+1)^n/n!,i,0,(2*k-1)/2)/(2*k-1),k,1,ceiling((n)/2)); /* Vladimir Kruchinin, Feb 25 2011 */

a(n):=sum(sum((2*i-2*k-1)^(2*n+1)*binomial(2*k+1,i)*(-1)^(n-i+1),i,0,k)/(4^k*(2*k+1)),k,0,n); /* Vladimir Kruchinin, Feb 04 2012 */

a(n) = n!*sum(k=1..ceiling(n/2), (1+(-1)^(n-2*k+1))*2^(1-2*k)*sum(i=0..(2*k-1)/2, (-1)^((n+1)/2-i)*binomial(2*k-1,i)*(2*i-2*k+1)^n/n!)/(2*k-1)), n>0. Vladimir Kruchinin, Feb 25 2011
G.f.: cos(x) /(1 + sin^2(x)) = 1 - 3*x^2/2! + 45*x^4/4! - ... . - Peter Bala, Feb 06 2017
a(n) ~ (-1)^n * (2*n)! / (log(1+sqrt(2)))^(2*n+1). - Vaclav Kotesovec, Aug 17 2018

cp's OEIS Frontend

A156168 A bisection of A002437.

Views

Author

Keywords

A156169 A bisection of A002437.

Views

Author

Keywords

A156172 Twice A002437.

Views

Author

Keywords

Comments

Programs

Maple

A002439 Glaisher's T numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A092731 Decimal expansion of Pi^5.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A104035 Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(0,0) = 1; T(0,k) = 0 if k>0 or if k<0; T(n,k) = k*T(n-1,k-1) + (k+1)*T(n-1,k+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

Extensions

A000281 Expansion of cos(x)/cos(2x).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A000191 Generalized tangent numbers d(3, n).

Views

Author

Keywords

References

Links

Crossrefs

A104035 Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(0,0) = 1; T(0,k) = 0 if k>0 or if k<0; T(n,k) = kT(n-1,k-1) + (k+1)T(n-1,k+1).