A000003 -id:A000003 - cp's OEIS frontend

A000192 Generalized Euler numbers c(6,n).

2, 46, 7970, 3487246, 2849229890, 3741386059246, 7205584123783010, 19133892392367261646, 67000387673723462963330, 299131045427247559446422446, 1658470810032820740402966226850, 11179247066648898992009055586869646, 90035623994788132387893239340761189570

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

Sean A. Irvine, Table of n, a(n) for n = 0..250
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]
Eric Weisstein's World of Mathematics, Euler Number.

Row 6 of A235605.

Cf. A000187, A000191, A000411, A001587, A349264.

egf := sec(6*x)*(cos(x) + cos(5*x)): ser := series(egf, x, 24):
seq((2*n)!*coeff(ser, x, 2*n), n = 0..10); # Peter Luschny, Nov 21 2021

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

t = PowerSeriesRing(QQ, 't', default_prec=24).gen()
f = 2 * cos(3 * t) / (2 * cos(4 * t) - 1)
f.egf_to_ogf().list()[::2] # F. Chapoton, Oct 06 2020

E.g.f.: 2*cos(3*x) / (2*cos(4*x) - 1). - F. Chapoton, Oct 06 2020
a(n) = (2*n)!*[x^(2*n)](sec(6*x)*(cos(x) + cos(5*x))). - Peter Luschny, Nov 21 2021
a(n) ~ 2^(6*n + 5/2) * 3^(2*n + 1/2) * n^(2*n + 1/2) / (Pi^(2*n + 1/2) * exp(2*n)). - Vaclav Kotesovec, Apr 15 2022

More terms from Eric W. Weisstein, Aug 30 2001

A000187 Generalized Euler numbers, c(5,n).

Original entry on oeis.org

2, 30, 3522, 1066590, 604935042, 551609685150, 737740947722562, 1360427147514751710, 3308161927353377294082, 10256718523496425979562270, 39490468691102039103925777602, 184856411587530526077816051412830, 1033888847501229495999134528615701122

Offset: 0

N. J. A. Sloane

			a(3) = 1066590: L_5(7) = Sum_{n >= 0} (-1)^n*( 1/(10*n+1)^7 + 1/(10*n+3)^7 + 1/(10*n+7)^7 + 1/(10*n+9)^7 ) = 1066590*( (1/6!)*sqrt(5)*(Pi/10)^7 ). - _Peter Bala_, Nov 18 2020

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

Sean A. Irvine, Table of n, a(n) for n = 0..250
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 5 of A235605.

Cf. A000192, A000490, A060096, A000320, A349265, A349264.

seq((-1)^n*(10)^(2*n)*(euler(2*n,1/10) + euler(2*n,3/10)), n = 0..11); # Peter Bala, Nov 18 2020
egf := sec(5*x)*(cos(2*x) + cos(4*x)): ser := series(egf, x, 26):
seq((2*n)!*coeff(ser, x, 2*n), n = 0..11); # Peter Luschny, Nov 21 2021

a0=5; nmax=20; km0 = nmax; Clear[cc]; L[a_, s_, km_] := Sum[JacobiSymbol[ -a, 2k+1]/(2k+1)^s, {k, 0, km}]; c[a_, n_, km_] := 2^(2n+1)*Pi^(-2n-1)*(2n)!*a^(2n+1/2)*L[a, 2n+1, km] // Round; cc[km_] := cc[km] = Table[ c[a0, n, km], {n, 0, nmax}]; cc[km0]; cc[km = 2km0]; While[cc[km] != cc[ km/2, km = 2km]]; A000187 = cc[km] (* Jean-François Alcover, Feb 05 2016 *)

From the Shanks paper: Consider the Dirichlet series L_a(s) = sum_{k>=0} (-a|2k+1) / (2k+1)^s, where (-a|2k+1) is the Jacobi symbol. Then the numbers c_(a,n) are defined by L_a(2n+1)= (Pi/(2a))^(2n+1)*sqrt(a)* c(a,n)/ (2n)! for a > 1 and n = 0,1,2,... - Sean A. Irvine, Mar 26 2012
From Peter Bala, Nov 18 2020: (Start)
a(n) = (-1)^n*10^(2*n)*( E(2*n,1/10) + E(2*n,3/10) ), where E(n,x) are the Euler polynomials - see A060096.
Row 5 of A235605.
G.f.: A(x) = 2*cos(x)*cos(3*x)/( 2*cos(x)*cos(4*x) - cos(3*x) ) = 2 + 30*x^2/2! + 3522*x^4/4! + ....
Alternative forms:
A(x) = (exp(i*x) + exp(3*i*x) + exp(7*i*x) + exp(9*i*x))/(1 + exp(10*i*x));
A(x) = (sqrt(5)/10)*( sec(x + Pi/5) + sec(x + 2*Pi/5) - sec(x + 3*Pi/5) - sec(x + 4*Pi/5) ).  (End)
a(n) = (2*n)!*[x^(2*n)](sec(5*x)*(cos(2*x) + cos(4*x))). - Peter Luschny, Nov 21 2021
a(n) ~ 2^(4*n + 2) * 5^(2*n + 1/2) * n^(2*n + 1/2) / (Pi^(2*n + 1/2) * exp(2*n)). - Vaclav Kotesovec, Apr 15 2022

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 02 2000

A000411 Generalized tangent numbers d(6,n).

Original entry on oeis.org

6, 522, 152166, 93241002, 97949265606, 157201459863882, 357802951084619046, 1096291279711115037162, 4350684698032741048452486, 21709332137467778453687752842, 133032729004732721625426681085926, 982136301747914281420205946546842922, 8597768767880274820173388403096814519366

Offset: 1

N. J. A. Sloane

nonn

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

Lars Blomberg, Table of n, a(n) for n = 1..184
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]

Cf. A000192, A000320, A001587, A349264.

egf := sec(6*x)*(sin(x) + sin(5*x)): ser := series(egf, x, 24):
seq((2*n-1)!*coeff(ser, x, 2*n-1), n = 1..12); # Peter Luschny, Nov 21 2021

nmax = 15; km0 = 10; Clear[dd]; L[a_, s_, km_] := Sum[JacobiSymbol[-a, 2 k + 1]/(2 k + 1)^s, {k, 0, km}]; d[a_ /; a > 1, n_, km_] := (2 n - 1)! L[-a, 2 n, km] (2 a/Pi)^(2 n)/Sqrt[a] // Round; dd[km_] := dd[km] = Table[d[6, n, km], {n, 1, nmax}]; dd[km0]; dd[km = 2 km0]; While[dd[km] != dd[km/2, km = 2 km]]; A000411 = dd[km] (* Jean-François Alcover, Feb 08 2016 *)

t = PowerSeriesRing(QQ, 't', default_prec=24).gen()
f = 2 * sin(3 * t) / (2 * cos(4 * t) - 1)
f.egf_to_ogf().list()[1::2] # F. Chapoton, Oct 06 2020

a(n) = (2*n-1)! * [x^(2*n-1)] 2*sin(3*x) / (2*cos(4*x) - 1). - F. Chapoton, Oct 06 2020

a(n) = (2*n-1)!*[x^(2*n-1)](sec(6*x)*(sin(x) + sin(5*x))). - Peter Luschny, Nov 21 2021

a(10)-a(12) from Lars Blomberg, Sep 07 2015

A106859 Primes of the form 2x^2 + xy + 2y^2.

Original entry on oeis.org

2, 3, 5, 17, 23, 47, 53, 83, 107, 113, 137, 167, 173, 197, 227, 233, 257, 263, 293, 317, 347, 353, 383, 443, 467, 503, 557, 563, 587, 593, 617, 647, 653, 677, 683, 743, 773, 797, 827, 857, 863, 887, 947, 953, 977, 983, 1013, 1097, 1103, 1163, 1187, 1193

Offset: 1

T. D. Noe, May 09 2005

Discriminant=-15.
If p is a prime >= 17 in this sequence then k==0 (mod 4) for all k satisfying "B(2k)(p^k-1) is an integer" where B are the Bernoulli numbers. - Benoit Cloitre, Nov 14 2005
Equals {2, 3, 5 and primes congruent to 17, 23 (mod 30)}; see A039949 and A132235. Except for 2, the same as primes of the form 3x^2 + 5y^2, which has discriminant -60. - T. D. Noe, May 02 2008
Equals {3, 5 and primes congruent to 2, 8 (mod 15)} sorted; see A033212. This form is in the only non-principal class (respectively, genus) for fundamental discriminant -15. - Rick L. Shepherd, Jul 25 2014 [See A343241 for the 2, 8 (mod 15) primes.]
From Wolfdieter Lang, Jun 08 2021: (Start)
Regarding the above comment of T. D. Noe on the form [3, 0, 5]: the class number h(-60) = 2 = A000003(15), and [1, 0, 15] is the principal reduced form, representing the primes given in A033212.
The form [3, 0, 5] represents the proper equivalence class of the second genus of forms of discriminant Disc = -60. The Legendre symbol for the odd primes, not 3 or 5, satisfy L(-3|p) = -1 and L(5|p) = -1, leading to primes p == {17, 23, 47, 53} (mod 60). See the Buell reference, p. 52, for the two characters L(p|3) and L(p|5). The prime 2 is represented by the imprimitive reduced form [2, 2, 8] of Disc = -60. (End)

D. A. Buell, Binary Quadratic Forms. Springer-Verlag, NY, 1989, pp. 51-52.

Vincenzo Librandi, N. J. A. Sloane and Ray Chandler, Table of n, a(n) for n = 1..10000 [First 2000 terms from Vincenzo Librandi, next 691 terms from N. J. A. Sloane]
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A000003, A139827, A039949, A132235, A033212, A343241.

QuadPrimes2[2, 1, 2, 100000] (* see A106856 *)

{ fc(a,b,c,M) = my(p,t1,t2,n); t1 = listcreate();
for(n=1,M, p = prime(n);
t2 = qfbsolve(Qfb(a,b,c),p); if(t2 == 0,, listput(t1,p)));
print(t1);
}
fc(2,1,2,1000); \\ N. J. A. Sloane, Jun 06 2014

Removed defective Mma program and extended the b-file using the PARI program fc. - N. J. A. Sloane, Jun 06 2014

A235606 Shanks's array d_{a,n} (a >= 1, n >= 1) that generalizes the tangent numbers, read by antidiagonals upwards.

Original entry on oeis.org

1, 1, 2, 2, 11, 16, 4, 46, 361, 272, 4, 128, 3362, 24611, 7936, 6, 272, 16384, 515086, 2873041, 353792, 8, 522, 55744, 4456448, 135274562, 512343611, 22368256, 8, 904, 152166, 23750912, 2080374784, 54276473326, 129570724921, 1903757312, 12, 1408, 355688

Offset: 1

N. J. A. Sloane, Jan 22 2014

			The array begins:
A000182: 1,  2,    16,      272,        7936,         353792, ...
A000464: 1, 11,   361,    24611,     2873041,      512343611, ...
A000191: 2, 46,  3362,   515086,   135274562,    54276473326, ...
A000318: 4,128, 16384,  4456448,  2080374784,  1483911200768, ...
A000320: 4,272, 55744, 23750912, 17328937984, 19313964388352, ...
A000411: 6,522,152166, 93241002, 97949265606,157201459863882, ...
A064072: 8,904,355688,296327464,423645846728,925434038426824, ...
...

D. Shanks. "Generalized Euler and Class Numbers." Math. Comput. 21, 689-694, 1967. Math. Comput. 22, 699, 1968.

Lars Blomberg, Table of n, a(n) for n = 1..5050
D. Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967), 689-694; 22 (1968), 699. [Annotated scanned copy]

Rows: A000182 (tangent numbers), A000464, A000191, A000318, A000320, A000411, A064072-A064075, ...
Columns: A000061, A000176, A000488, A000518, ...
Cf. A235605.

amax = nmax = 10; km0 = 10; Clear[dd]; L[a_, s_, km_] := Sum[JacobiSymbol[ -a, 2k+1]/(2k+1)^s, {k, 0, km}]; d[1, n_, km_] := 2(2n-1)! L[-1, 2n, km] (2/Pi)^(2n) // Round; d[a_ /; a>1, n_, km_] := (2n-1)! L[-a, 2n, km] (2a/ Pi)^(2n)/Sqrt[a] // Round; dd[km_] := dd[km] = Table[d[a, n, km], {a, 1, amax}, {n, 1, nmax}]; dd[km0]; dd[km = 2km0]; While[dd[km] != dd[km/2, km = 2km]]; A235606 = dd[km]; Table[A235606[[ a-n+1, n]], {a, 1, amax}, {n, 1, a}] // Flatten (* Jean-François Alcover, Feb 05 2016 *)
dds[b_, nm_] := With[{ns = Range[nm]}, (-1)^(ns - 1) If[Mod[b, 4] == 1, Sum[JacobiSymbol[k, b] (b - 4 k)^(2 ns - 1), {k, 1, (b - 1)/2}], Sum[JacobiSymbol[b, 2 k + 1] (b - (2 k + 1))^(2 ns - 1), {k, 0, (b - 2)/2}]]];
dsfs[1, nm_] := dsfs[1, nm] = (2 Range[nm] - 1)! CoefficientList[Series[Tan[x], {x, 0, 2 nm - 1}]/x, x^2];
dsfs[b_, nm_] := dsfs[b, nm] = Fold[Function[{ds, dd}, Append[ds, dd - Sum[ds[[-i]] (-b^2)^i Binomial[2 Length[ds] + 1, 2 i], {i, Length[ds]}]]], {}, dds[b, nm]];
rowA235606[a_, nm_] := With[{facs = FactorInteger[a], ns = Range[nm]}, With[{b = Times @@ (#^Mod[#2, 2] &) @@@ facs}, If[a == b, dsfs[b, nm], If[b == 1, 1/2, 1] dsfs[b, nm] Sqrt[a/b]^(4 ns - 1) Times @@ Cases[facs, {p_, e_} /; p > 2 && e > 1 :> 1 - JacobiSymbol[b, p]/p^(2 ns)]]]];
arr = Table[rowA235606[a, 10], {a, 10}];
Flatten[Table[arr[[r - n + 1, n]], {r, Length[arr]}, {n, r}]] (* Matthew House, Oct 30 2024 *)

Shanks gives recurrences.

More terms from Lars Blomberg, Sep 07 2015

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

A000320 Generalized tangent numbers d(5,n).

Original entry on oeis.org

4, 272, 55744, 23750912, 17328937984, 19313964388352, 30527905292468224, 64955605537174126592, 179013508069217017790464, 620314831396713435870789632, 2639743384489464189324523208704, 13533573366345611477262311433961472, 82274260343572247169162187576069586944

Offset: 1

N. J. A. Sloane

nonn

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

Lars Blomberg, Table of n, a(n) for n = 1..189
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]

Cf. A000318, A000187, A349265, A349264.

egf := sec(5*x)*(sin(x) + sin(3*x)): ser := series(egf, x, 26):
seq((2*n-1)!*coeff(ser, x, 2*n-1), n = 1..13); # Peter Luschny, Nov 21 2021

nmax = 15; km0 = 10; Clear[dd]; L[a_, s_, km_] := Sum[JacobiSymbol[-a, 2 k + 1]/(2k+1)^s, {k, 0, km}]; d[a_ /; a>1, n_, km_] := (2n-1)! L[-a, 2n, km] (2a/Pi)^(2n)/Sqrt[a] // Round; dd[km_] := dd[km] = Table[d[5, n, km], {n, 1, nmax}]; dd[km0]; dd[km = 2km0]; While[dd[km] != dd[km/2, km = 2 km]]; A000320 = dd[km] (* Jean-François Alcover, Feb 07 2016 *)

a(n) = (2*n-1)!*[x^(2*n-1)](sec(5*x)*(sin(x) + sin(3*x))). - Peter Luschny, Nov 21 2021

Formula producing A000326, rather than this sequence, deleted by Sean A. Irvine, Sep 09 2010

a(10)-a(13) from Lars Blomberg, Sep 07 2015

A000061 Generalized tangent numbers d(n,1).

Original entry on oeis.org

1, 1, 2, 4, 4, 6, 8, 8, 12, 14, 14, 16, 20, 20, 24, 32, 24, 30, 38, 32, 40, 46, 40, 48, 60, 50, 54, 64, 60, 68, 80, 64, 72, 92, 76, 96, 100, 82, 104, 112, 96, 108, 126, 112, 120, 148, 112, 128, 168, 130, 156, 160, 140, 162, 184, 160, 168, 198, 170, 192, 220, 168, 192

Offset: 1

N. J. A. Sloane

nonn

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

Sean A. Irvine, Table of n, a(n) for n = 1..10000
Donald E. Knuth and Thomas J. Buckholtz, Computation of tangent, Euler and Bernoulli numbers, Math. Comp. 21 1967 663-688.
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]
Peter J. Taylor, Python program to compute terms for this and related sequences
Eric Weisstein's World of Mathematics, Tangent Number

Column 1 of A235606.

Cf. A000176.

Table[rowA235606[n, 1][[1]], {n, 60}] (* see A235606 *) (* Matthew House, Nov 10 2024 *)

Python
```
# See Taylor link.
```

From Sean A. Irvine, Mar 26 2012, corrected by Peter J. Taylor, Sep 26 2017: (Start)
Consider the Dirichlet series L_a(s) = sum_{k>=0} (-a|2k+1) / (2k+1)^s, where (-a|2k+1) is the Jacobi symbol. Then the numbers d(a,n) are defined by L_-a(2n)= (pi/(2a))^(2n)*sqrt(a)* d(a,n)/ (2n-1)! for a>1 and n=1,2,3...; or by L_-a(2n)= (1/2)*(pi/(2a))^(2n)*sqrt(a)* d(a,n)/ (2n-1)! for a=1 and n=1,2,3,...
From the Shanks paper, these can be computed as:
d(1,n)=A000182(n)
d(m^2,n)=(1/2) * m^(2n-1) * (m*prod_(p_i|m)(p_i^(-1)))^(2*n) * prod_(p_i|m)(p_i^(2*n)-1) * d(1,n)
Otherwise write a=bm^2, b squarefree, then d(a,n)=m^(2n-1) * (m*prod_(p_i|m)(p_i^(-1)))^(2*n) * prod_(p_i|m)(p_i^(2*n)-jacobi(b,p_i)) * d(b,n) with d(b,n), b squarefree determined by equating the recurrence
D(b,n)=sum(d(b,n-i)*(-b^2)^i*C(2n-1,2i),i=0..n-1)with the case-wise expression
D(b,n)=(-1)^(n-1) * sum(jacobi(k,b)*(b-4k)^(2n-1), k=1..(b-1)/2) if b == 1(mod 4)
D(b,n)=(-1)^(n-1) * sum(jacobi(b,2k+1)*(b-(2k+1))^(2n-1),2k+1Sequence gives a(n)=d(n,1). (End)

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 03 2000

It would be nice to have a more precise definition! - N. J. A. Sloane, May 26 2007

A000233 Generalized class numbers c_(n,1).

Original entry on oeis.org

1, 3, 8, 16, 30, 46, 64, 96, 126, 158, 216, 256, 302, 396, 448, 512, 636, 702, 792, 960, 1052, 1118, 1344, 1472, 1550, 1866, 1944, 2048, 2442, 2540, 2688, 3072, 3212, 3388, 3888, 4032, 4094, 4746, 4928, 5056, 5832, 5852, 5976, 6912, 7020, 7180, 8064, 8192

Offset: 1

N. J. A. Sloane

Let L_a(s) = Sum_{k>=0} (-a|2k+1) /(2k+1)^s be a Dirichlet series, where (-a|2k+1) is the Jacobi symbol. Then the c_(a,n) are defined by L_a(2n+1) = (Pi/(2a))^(2n+1)*sqrt(a)*c_(a,n)/(2n)! for n=0,1,2,..., a=1,2,3,...

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

Matthew House, Table of n, a(n) for n = 1..10000
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]

Cf. A000508, A000362.

amax = 50; nmax = 1; km0 = 10; Clear[cc]; L[a_, s_, km_] := Sum[ JacobiSymbol[-a, 2 k + 1]/(2 k + 1)^s, {k, 0, km}]; c[1, n_, km_] := 2 (2 n)! L[1, 2 n + 1, km] (2/Pi)^(2 n + 1) // Round; c[a_ /; a > 1, n_, km_] := (2 n)! L[a, 2 n + 1, km] (2 a/Pi)^(2 n + 1)/Sqrt[a] // Round; cc[km_] := cc[km] = Table[c[a, n, km], {a, 1, amax}, {n, 0, nmax}]; cc[km0]; cc[ km = 2 km0]; While[cc[km] != cc[km/2, km = 2 km]]; A000233 = cc[km][[All, 2]] (* Jean-François Alcover, Feb 06 2016 *)
Table[rowA235605[n, 1][[2]], {n, 50}] (* see A235605 *) (* Matthew House, Oct 05 2024 *)

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 02 2000

Name clarified by James C. McMahon, Nov 30 2023

A000318 Generalized tangent numbers d(4,n).

Original entry on oeis.org

4, 128, 16384, 4456448, 2080374784, 1483911200768, 1501108249821184, 2044143848640217088, 3605459138582973251584, 7995891855149741436305408, 21776918737280678860353961984, 71454103701490016776039304265728, 278008871543597996197497752082448384

Offset: 1

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

T. D. Noe, Table of n, a(n) for n = 1..100
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]
Eric Weisstein's World of Mathematics, Padé approximants.

Cf. A000182, A000191, A000490, A349264.

egf := sec(4*x)*sin(4*x): ser := series(egf, x, 26):
seq((2*n-1)!*coeff(ser, x, 2*n-1), n = 1..12); # Peter Luschny, Nov 21 2021

nn = 30; t = Rest@Union[Range[0, nn - 1]! CoefficientList[Series[Tan[x], {x, 0, nn}], x]]; t2 = t*2^Range[2, 2*nn, 4] (* T. D. Noe, Jun 19 2012 *)

a(n) = 2^(4n-2) * A000182(n).
The g.f. has the following continued fraction expansion: g.f. = [4, b(0), c(0), b(1), c(1), b(2), c(2), ...] where b(n) = (Sum_{k=0..n} 1/(2*k+1))^2 / (128*(n+1)*x), c(n) = -4/((2*n+3)*(Sum_{k=0..n} 1/(2*k+1))*(Sum_{k=0..n+1} 1/(2*k+1))) and each convergent of this continued fraction is a Padé approximant of the Maclaurin series Sum_{k>=1} a(n)*x^(n-1). - Thomas Baruchel, Oct 19 2005
a(n) = (2*n-1)!*[x^(2*n-1)](sec(4*x)*sin(4*x)). - Peter Luschny, Nov 21 2021

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 03 2000

Previous Showing 11-20 of 48 results. Next

cp's OEIS Frontend

A000192 Generalized Euler numbers c(6,n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

Extensions

A000187 Generalized Euler numbers, c(5,n).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A000411 Generalized tangent numbers d(6,n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

Extensions

A106859 Primes of the form 2x^2 + xy + 2y^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A235606 Shanks's array d_{a,n} (a >= 1, n >= 1) that generalizes the tangent numbers, read by antidiagonals upwards.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

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

A000320 Generalized tangent numbers d(5,n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple