A007289 -id:A007289 - cp's OEIS frontend

A349264 Generalized Euler numbers, a(n) = n![x^n](sec(4x)(sin(4x) + 1)).

1, 4, 16, 128, 1280, 16384, 249856, 4456448, 90767360, 2080374784, 52975108096, 1483911200768, 45344872202240, 1501108249821184, 53515555843342336, 2044143848640217088, 83285910482761809920, 3605459138582973251584, 165262072909347030040576, 7995891855149741436305408

Offset: 0

Peter Luschny, Nov 20 2021

nonn

			Exponential generating functions of generalized Euler numbers in context:
egf1 = sec(1*x)*(sin(x) + 1).
   [A000111, A000364, A000182]
egf2 = sec(2*x)*(sin(x) + cos(x)).
   [A001586, A000281, A000464]
egf3 = sec(3*x)*(sin(2*x) + cos(x)).
   [A007289, A000436, A000191]
egf4 = sec(4*x)*(sin(4*x) + 1).
   [A349264, A000490, A000318]
egf5 = sec(5*x)*(sin(x) + sin(3*x) + cos(2*x) + cos(4*x)).
   [A349265, A000187, A000320]
egf6 = sec(6*x)*(sin(x) + sin(5*x) + cos(x) + cos(5*x)).
   [A001587, A000192, A000411]
egf7 = sec(7*x)*(-sin(2*x) + sin(4*x) + sin(6*x) + cos(x) + cos(3*x) - cos(5*x)).
   [A349266, A064068, A064072]
egf8 = sec(8*x)*2*(sin(4*x) + cos(4*x)).
   [A349267, A064069, A064073]
egf9 = sec(9*x)*(4*sin(3*x) + 2)*cos(3*x)^2.
   [A349268, A064070, A064074]

Matthew House, Table of n, a(n) for n = 0..389
William Y. C. Chen, Neil J. Y. Fan, Jeffrey Y. T. Jia, The generating function for the Dirichlet series Lm(s), Mathematics of Computation, Vol. 81, No. 278, pp. 1005-1023, April 2012.
Ruth Lawrence and Don Zagier, Modular forms and quantum invariants of 3-manifolds, Asian J. Math. 3 (1999), no. 1, 93-107.
D. Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967) 689-694.
D. Shanks, Corrigendum: 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]

Row 4 of A349271.
Cf. A000111, A001586, A007289, A349265, A001587, A349266, A349267, A349268.
Secant  bisections: A000364, A000281, A000436, A000490, A000187, A000192, A064068, A064069, A064070.
Tangent bisections: A000182, A000464, A000191, A000318, A000320, A000411, A064072, A064073, A064074.
Cf. A225147, A349429.

sec(4*x)*(sin(4*x) + 1): series(%, x, 20): seq(n!*coeff(%, x, n), n = 0..19);

m = 19; CoefficientList[Series[Sec[4*x] * (Sin[4*x] + 1), {x, 0, m}], x] * Range[0, m]! (* Amiram Eldar, Nov 20 2021 *)

seq(n)={my(x='x + O('x^(n+1))); Vec(serlaplace((sin(4*x) + 1)/cos(4*x)))} \\ Andrew Howroyd, Nov 20 2021

A352252 Expansion of e.g.f. 1 / (1 - x * cos(x)).

Original entry on oeis.org

1, 1, 2, 3, 0, -55, -480, -3157, -15232, -16623, 898560, 16316179, 194574336, 1666248025, 5418649600, -170157839685, -5164467978240, -92955464490463, -1188910801354752, -7329026447550685, 157257042777866240, 7516793832172469481, 187200588993188069376

Offset: 0

Ilya Gutkovskiy, Mar 09 2022

sign

Seiichi Manyama, Table of n, a(n) for n = 0..456

Cf. A000111, A007289, A009189, A094088, A205571, A302397, A352250, A352251.

nmax = 22; CoefficientList[Series[1/(1 - x Cos[x]), {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = Sum[(-1)^k Binomial[n, 2 k + 1] (2 k + 1) a[n - 2 k - 1], {k, 0, Floor[(n - 1)/2]}]; Table[a[n], {n, 0, 22}]

my(x='x+O('x^30)); Vec(serlaplace(1 / (1 - x * cos(x)))) \\ Michel Marcus, Mar 10 2022

a185951(n, k) = binomial(n, k)/2^k*sum(j=0, k, (2*j-k)^(n-k)*binomial(k, j));
a(n) = sum(k=0, n, k!*I^(n-k)*a185951(n, k)); \\ Seiichi Manyama, Feb 17 2025

a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} (-1)^k * binomial(n,2*k+1) * (2*k+1) * a(n-2*k-1).

a(n) = Sum_{k=0..n} k! * i^(n-k) * A185951(n,k), where i is the imaginary unit. - Seiichi Manyama, Feb 17 2025

A000436 Generalized Euler numbers c(3,n).

Original entry on oeis.org

1, 8, 352, 38528, 7869952, 2583554048, 1243925143552, 825787662368768, 722906928498737152, 806875574817679474688, 1118389087843083461066752, 1884680130335630169428983808, 3794717805092151129643367268352

Offset: 0

N. J. A. Sloane

nonn

			G.f. = 1 + 8*x + 352*x^2 + 38528*x^3 + 7869952*x^4 + 2583554048*x^5 + ...

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
Michael E. Hoffman, Derivative polynomials, Euler Polynomials, and associated integer sequences, El. J. Combinat. 6 (see Th. 3.3).
D. Shanks, Generalized Euler and class numbers. Math. Comp. 21 (1967) 689-694.
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]

Row 3 of A235605.
Bisections: A156177 and A156178.
Cf. A000191, A007289, overview in A349264.
Cf. A210657, A255882.

A000436 := proc(nmax) local a,n,an; a := [1] : n := 1 : while nops(a)< nmax do an := 1-sum(binomial(2*n,2*i)*3^(2*n-2*i)*(-1)^i*op(i+1,a),i=0..n-1) : a := [op(a),an*(-1)^n] ; n := n+1 ; od ; RETURN(a) ; end:
A000436(10) ; # R. J. Mathar, Nov 19 2006
a := n -> 2*(-144)^n*(Zeta(0,-2*n,1/6)-Zeta(0,-2*n,2/3)):
seq(a(n), n=0..12); # Peter Luschny, Mar 11 2015

a[0] = 1; a[n_] := a[n] = (-1)^n*(1 - Sum[(-1)^i*Binomial[2n, 2i]*3^(2n - 2i)*a[i], {i, 0, n-1}]); Table[a[n], {n, 0, 12}] (* Jean-François Alcover, Jan 31 2012, after R. J. Mathar *)
With[{nn=30},Take[CoefficientList[Series[Cos[x]/Cos[3x],{x,0,nn}], x] Range[ 0,nn]!,{1,-1,2}]] (* Harvey P. Dale, May 22 2012 *)

x='x+O('x^66); v=Vec(serlaplace( cos(x) / cos(3*x) ) ); vector(#v\2,n,v[2*n-1]) \\ Joerg Arndt, Apr 27 2013

from mpmath import mp, lerchphi
mp.dps = 32; mp.pretty = True
def A000436(n): return abs(3^(2*n)*2^(2*n+1)*lerchphi(-1,-2*n,1/3))
[A000436(n) for n in (0..12)]  # Peter Luschny, Apr 27 2013

E.g.f.: cos(x) / cos(3*x) (even powers only).
For n>0, a(n) = A002114(n)*2^(2n+1) = (1/3)*A002112(n)*2^(2n+1). - Philippe Deléham, Jan 17 2004
a(n) = Sum_{k=0..n} (-1)^k*9^(n-k)*A086646(n,k). - Philippe Deléham, Oct 27 2006
(-1)^n a(n) = 1 - Sum_{i=0..n-1} (-1)^i*binomial(2n,2i)*3^(2n-2i)*a(i). - R. J. Mathar, Nov 19 2006
a(n) = P_{2n}(sqrt(3))/sqrt(3) (where the polynomials P_n() are defined in A155100). - N. J. A. Sloane, Nov 05 2009
E.g.f.: E(x) = cos(x)/cos(3*x) = 1 + 4*x^2/(G(0)-2*x^2); G(k) = (2*k+1)*(k+1) - 2*x^2 + 2*x^2*(2*k+1)*(k+1)/G(k+1); (continued fraction, Euler's kind, 1-step). - Sergei N. Gladkovskii, Jan 02 2012
G.f.: 1 / (1 - 2*4*x / (1 - 6*6*x / (1 - 8*10*x / (1 - 12*12*x / (1 - 14*16*x / (1 - 18*18*x / ...)))))). - Michael Somos, May 12 2012
a(n) = | 3^(2*n)*2^(2*n+1)*lerchphi(-1,-2*n,1/3) |. - Peter Luschny, Apr 27 2013
a(n) = (-1)^n*6^(2*n)*E(2*n,1/3), where E(n,x) denotes the n-th Euler polynomial. Calculation suggests that the expansion exp( Sum_{n >= 1} a(n)*x^n/n ) = exp( 8*x + 352*x^2/2 + 38528*x^3/3 + ... ) = 1 + 8*x + 208*x^2 + 14336*x^3 + ... has integer coefficients. Cf. A255882. - Peter Bala, Mar 10 2015
a(n) = 2*(-144)^n*(zeta(-2*n,1/6)-zeta(-2*n,2/3)), where zeta(a,z) is the generalized Riemann zeta function. - Peter Luschny, Mar 11 2015
From Vaclav Kotesovec, May 05 2020: (Start)
For n>0, a(n) = (2*n)! * (zeta(2*n+1, 1/6) - zeta(2*n+1, 5/6)) / (sqrt(3)*Pi^(2*n+1)).
For n>0, a(n) = (-1)^(n+1) * 2^(2*n-1) * Bernoulli(2*n) * (zeta(2*n+1, 1/6) - zeta(2*n+1, 5/6)) / (Pi*sqrt(3)*zeta(2*n)). (End)
Conjecture: for each positive integer k, the sequence defined by a(n) (mod k) is eventually periodic with period dividing phi(k). For example, modulo 13 the sequence becomes [1, 8, 1, 9, 12, 10, 0, 8, 1, 9, 12, 10, 0, ...]; after the initial term 1 this appears to be a periodic sequence of period 6, a divisor of phi(13) = 12. - Peter Bala, Dec 11 2021

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

A349271 Array A(n, k) that generalizes Euler numbers, class numbers, and tangent numbers, read by ascending antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 4, 8, 11, 5, 2, 4, 16, 46, 57, 16, 1, 6, 30, 128, 352, 361, 61, 2, 8, 46, 272, 1280, 3362, 2763, 272, 2, 8, 64, 522, 3522, 16384, 38528, 24611, 1385, 2, 12, 96, 904, 7970, 55744, 249856, 515086, 250737, 7936

Offset: 1

Peter Luschny, Nov 23 2021

			Seen as an array:
[1] 1,  1,   1,    2,     5,      16,       61,        272, ... [A000111]
[2] 1,  1,   3,   11,    57,     361,     2763,      24611, ... [A001586]
[3] 1,  2,   8,   46,   352,    3362,    38528,     515086, ... [A007289]
[4] 1,  4,  16,  128,  1280,   16384,   249856,    4456448, ... [A349264]
[5] 2,  4,  30,  272,  3522,   55744,  1066590,   23750912, ... [A349265]
[6] 2,  6,  46,  522,  7970,  152166,  3487246,   93241002, ... [A001587]
[7] 1,  8,  64,  904, 15872,  355688,  9493504,  296327464, ... [A349266]
[8] 2,  8,  96, 1408, 29184,  739328, 22634496,  806453248, ... [A349267]
[9] 2, 12, 126, 2160, 49410, 1415232, 48649086, 1951153920, ... [A349268]
.
Seen as a triangle:
[1] 1;
[2] 1, 1;
[3] 1, 1,  1;
[4] 1, 2,  3,   2;
[5] 2, 4,  8,  11,    5;
[6] 2, 4, 16,  46,   57,    16;
[7] 1, 6, 30, 128,  352,   361,    61;
[8] 2, 8, 46, 272, 1280,  3362,  2763,   272;
[9] 2, 8, 64, 522, 3522, 16384, 38528, 24611, 1385;

William Y. C. Chen, Neil J. Y. Fan, and Jeffrey Y. T. Jia, The generating function for the Dirichlet series Lm(s), Mathematics of Computation, Vol. 81, No. 278, pp. 1005-1023, April 2012.
Ruth Lawrence and Don Zagier, Modular forms and quantum invariants of 3-manifolds, Asian J. Math. 3 (1999), no. 1, 93-107.
D. Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967) 689-694.
D. Shanks, Corrigendum: 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]

A235605 (array generalized Euler secant numbers).
A235606 (array generalized Euler tangent numbers).
A349264 (overview generating functions).
Rows: A000111, A001586, A007289, A349265, A001587, A349266, A349267, A349268.
Columns: A000003 (class numbers), A000061, A000233, A000176, A000362, A000488, A000508, A000518.
Cf. A349263 (main diagonal).

A006873 Number of alternating 4-signed permutations.

Original entry on oeis.org

1, 1, 7, 47, 497, 6241, 95767, 1704527, 34741217, 796079041, 20273087527, 567864586607, 17352768515537, 574448847467041, 20479521468959287, 782259922208550287, 31872138933891307457, 1379749466246228538241, 63243057486503656319047, 3059895336952604166395567

Offset: 0

N. J. A. Sloane and Simon Plouffe

nonn

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
R. Ehrenborg and M. A. Readdy, Sheffer posets and r-signed permutations, Preprint, 1994. (Annotated scanned copy)
Richard Ehrenborg and Margaret A. Readdy, Sheffer posets and r-signed permutations, Annales des Sciences Mathématiques du Québec, 19 (1995), 173-196.

Cf. A007286, A007289, A225109.

m:=50; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(Sin(x)+Cos(3*x))/Cos(4*x)); [Factorial(n-1)*b[n]: n in [1..m-1]]; // G. C. Greubel, Nov 29 2018

per4 := proc(n) local j; 2*((1-I)/(1+I))^n*(1+add(binomial(n,j)* polylog(-j,I)*4^j, j=0..n)) end: A006873 := n -> Re(per4(n));
seq(A006873(i), i=0..11); # Peter Luschny, Apr 29 2013

mx = 17; Range[0, mx]! CoefficientList[ Series[ (Sin[x] + Cos[3x])/Cos[4x], {x, 0, mx}], x] (* Robert G. Wilson v, Apr 28 2013 *)

x='x+O('x^66); Vec(serlaplace((sin(x)+cos(3*x))/cos(4*x))) \\ Joerg Arndt, Apr 28 2013

f=(sin(x) + cos(3*x))/cos(4*x)
g=f.taylor(x,0,50)
L=g.coefficients()
coeffs={c[1]:c[0]*factorial(c[1]) for c in L}
coeffs # G. C. Greubel, Nov 29 2018

E.g.f.: (sin(x) + cos(3*x)) / cos(4*x). - M. F. Hasler, Apr 28 2013
a(n) = Re(2*((1-I)/(1+I))^n*(1 + Sum_{j=0..n}(binomial(n,j)*Li_{-j}(I)* 4^j))). - Peter Luschny, Apr 29 2013
a(n) ~ sqrt(2-sqrt(2)) * 2^(3*n+3/2) * n^(n+1/2) / (Pi^(n+1/2) * exp(n)). - Vaclav Kotesovec, Feb 25 2014
a(n) ~ GAMMA(n)*8^n/(Pi^n*(2*sqrt(4+2*sqrt(2)))). - Simon Plouffe, Nov 29 2018

Added more terms, Joerg Arndt, Apr 28 2013

A007286 E.g.f.: (sin x + cos 2x) / cos 3x.

Original entry on oeis.org

1, 1, 5, 26, 205, 1936, 22265, 297296, 4544185, 78098176, 1491632525, 31336418816, 718181418565, 17831101321216, 476768795646785, 13658417358350336, 417370516232719345, 13551022195053101056

Offset: 0

N. J. A. Sloane and Simon Plouffe

nonn

Arises in the enumeration of alternating 3-signed permutations.

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
R. Ehrenborg and M. A. Readdy, Sheffer posets and r-signed permutations, Preprint, 1994. (Annotated scanned copy)
Richard Ehrenborg and Margaret A. Readdy, Sheffer posets and r-signed permutations, Annales des Sciences Mathématiques du Québec 19:2 (1995), 173-196.

Cf. A006873, A007289, A225109, A002438 (bisection?).

mx = 17; Range[0, mx]! CoefficientList[ Series[ (Sin[x] + Cos[2x])/Cos[3 x], {x, 0, mx}], x] (* Robert G. Wilson v, Apr 28 2013 *)

x='x+O('x^66); Vec(serlaplace((sin(x)+cos(2*x))/cos(3*x))) \\ Joerg Arndt, Apr 28 2013

from mpmath import mp, polylog, re
mp.dps = 32; mp.pretty = True
def aperm3(n): return 2*((1-I)/(1+I))^n*(1+add(binomial(n,j)*polylog(-j,I)*3^j for j in (0..n)))
def A007286(n) : return re(aperm3(n))
[int(A007286(n)) for n in (0..17)] # Peter Luschny, Apr 28 2013

a(n) = Re(2*((1-I)/(1+I))^n*(1+sum_{j=0..n}(binomial(n,j)*Li_{-j}(I)*3^j))). - Peter Luschny, Apr 28 2013

a(n) ~ n! * 2^(n+1)*3^n/Pi^(n+1). - Vaclav Kotesovec, Jun 15 2013

A349265 Generalized Euler numbers, a(n) = n![x^n](sec(5x)(sin(x) + sin(3x) + cos(2x) + cos(4x))).

Original entry on oeis.org

2, 4, 30, 272, 3522, 55744, 1066590, 23750912, 604935042, 17328937984, 551609685150, 19313964388352, 737740947722562, 30527905292468224, 1360427147514751710, 64955605537174126592, 3308161927353377294082, 179013508069217017790464, 10256718523496425979562270

Offset: 0

Peter Luschny, Nov 20 2021

nonn

For references and examples see A349264.

Matthew House, Table of n, a(n) for n = 0..377

Row 5 of A349271.

Cf. A000111, A001589, A007289, A349264, A001587.

m = 18; CoefficientList[Series[Sec[5*x] * (Sin[x] + Sin[3*x] + Cos[2*x] + Cos[4*x]), {x, 0, m}], x] * Range[0, m]! (* Amiram Eldar, Nov 20 2021 *)

seq(n)={my(x='x + O('x^(n+1))); Vec(serlaplace((sin(x) + sin(3*x) + cos(2*x) + cos(4*x))/cos(5*x)))} \\ Andrew Howroyd, Nov 20 2021

t = PowerSeriesRing(QQ, 't', default_prec=19).gen()
f = (sin(t) + sin(3*t) + cos(2*t) + cos(4*t)) / cos(5*t)
f.egf_to_ogf().list()

A000810 Expansion of e.g.f. (sin x + cos x)/cos 3x.

Original entry on oeis.org

1, 1, 8, 26, 352, 1936, 38528, 297296, 7869952, 78098176, 2583554048, 31336418816, 1243925143552, 17831101321216, 825787662368768, 13658417358350336, 722906928498737152, 13551022195053101056

Offset: 0

N. J. A. Sloane

nonn

R. J. Mathar, Table of n, a(n) for n = 0..200

Cf. A007286, A007289.

(-1)^(n*(n-1)/2)*a(n) gives the alternating row sums of A225118. - Wolfdieter Lang, Jul 12 2017

CoefficientList[Series[(Sin[x]+Cos[x])/Cos[3*x], {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Jun 25 2013 *)
Table[Abs[EulerE[n, 1/3]] 6^n, {n, 0, 20}] (* Vladimir Reshetnikov, Oct 21 2015 *)

x='x+O('x^66); v=Vec(serlaplace( (sin(x)+cos(x)) / cos(3*x) ) ) \\ Joerg Arndt, Apr 27 2013

from mpmath import mp, lerchphi
mp.dps = 32; mp.pretty = True
def A000810(n): return abs(3^n*2^(n+1)*lerchphi(-1,-n,1/3))
[int(A000810(n)) for n in (0..17)]  # Peter Luschny, Apr 27 2013

a(2n) = A000436(n).
(-1)^n*a(2n+1)=1-sum_{i=0,1,...,n-1} (-1)^i*binomial(2n+1,2i+1)*3^(2n-2i)*a(2i+1). - R. J. Mathar, Nov 19 2006
a(n) = | 3^n*2^(n+1)*lerchphi(-1,-n,1/3) |. - Peter Luschny, Apr 27 2013
a(n) ~ n!*2^(n+1)*3^(n+1/2)/Pi^(n+1) if n is even and a(n) ~ n!*2^(n+1)*3^n/Pi^(n+1) if n is odd. - Vaclav Kotesovec, Jun 25 2013
a(n) = (-1)^floor(n/2)*3^n*skp(n, 1/3), where skp(n,x) are the Swiss-Knife polynomials A153641. - Peter Luschny, Apr 19 2014

A225109 E.g.f. (sin(3x) + cos x) / cos(4x).

Original entry on oeis.org

1, 3, 15, 117, 1185, 15123, 230895, 4116837, 83860545, 1921996323, 48942778575, 1370953667157, 41893214676705, 1386843017916723, 49441928730798255, 1888542637550347077, 76946148390480577665, 3331009898404800736323, 152682246738275154625935, 7387240827905368219116597

Offset: 0

M. F. Hasler, Apr 28 2013

nonn

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

Cf. A006873, A007289, A007286.

per4 := proc(n) local j; 2*((1-I)/(1+I))^n*(1+add(binomial(n,j)* polylog(-j,I)*4^j, j=0..n)) end: A225109 := n -> Im(per4(n));
seq(A225109(i), i=0..11); # Peter Luschny, Apr 29 2013

mx = 17; Range[0, mx]! CoefficientList[ Series[ (Sin[3x] + Cos[x])/Cos[4x], {x, 0, mx}], x] (* Robert G. Wilson v, Apr 28 2013 *)

v=Vec((sin(3*x) + cos(x)) / cos(4*x)); vector(#v,i,v[i]*(i-1)!)

x='x+O('x^66); Vec(serlaplace((sin(3*x)+cos(x))/cos(4*x))) \\ Joerg Arndt, Apr 28 2013

a(n) = Im(2*((1-I)/(1+I))^n*(1+sum_{j=0..n}(binomial(n,j)*Li_{-j}(I)* 4^j))). - Peter Luschny, Apr 29 2013

a(n) ~ n! * sqrt(2+sqrt(2)) * 2^(3*n+1)/Pi^(n+1). - Vaclav Kotesovec, Jun 02 2013

cp's OEIS Frontend

A349264 Generalized Euler numbers, a(n) = n!*[x^n](sec(4*x)*(sin(4*x) + 1)).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A352252 Expansion of e.g.f. 1 / (1 - x * cos(x)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A000436 Generalized Euler numbers c(3,n).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

A000191 Generalized tangent numbers d(3, n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A349271 Array A(n, k) that generalizes Euler numbers, class numbers, and tangent numbers, read by ascending antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

A006873 Number of alternating 4-signed permutations.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A007286 E.g.f.: (sin x + cos 2x) / cos 3x.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

A349264 Generalized Euler numbers, a(n) = n![x^n](sec(4x)(sin(4x) + 1)).

A349265 Generalized Euler numbers, a(n) = n![x^n](sec(5x)(sin(x) + sin(3x) + cos(2x) + cos(4x))).