|
Search: id:A120337
|
|
|
| A120337 |
|
Euler-irregular primes p dividing E(2k) for some 2k<p-1. |
|
+0
2
|
|
| 19, 31, 43, 47, 61, 67, 71, 79, 101, 137, 139, 149, 193, 223, 241
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Wagstaff, Samuel S. Prime divisors of the Bernoulli and Euler numbers p. 357-374, 2002. MR 1956285
|
|
LINKS
|
Prime Pages, Euler Irregular
|
|
FORMULA
|
The (trivial) divisors of E(2n) are given by the theorem of Sylvester (1861): Let p prime with p=1 (mod 4), p-1|2n, p^k|2n then p^{k+1} | E(2n).
|
|
CROSSREFS
|
Cf. A092218, A120115.
Sequence in context: A040088 A164320 A154418 this_sequence A120115 A157995 A043298
Adjacent sequences: A120334 A120335 A120336 this_sequence A120338 A120339 A120340
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Stefan Kraemer (skraemer(AT)math.uni-goettingen.de), Jun 22 2006
|
|
|
Search completed in 0.002 seconds
|
