|
|
A069042
|
|
Numbers n such that the n-th Euler number (A000364) == 1 (mod n^2).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
Table of n, a(n) for n=1..5.
|
|
MATHEMATICA
|
Select[Range[2, 10000], Divisible[Abs[EulerE[2*#]] - 1, #^2] &] (* Amiram Eldar, Jun 03 2017 *)
|
|
CROSSREFS
|
Cf. A000364, A081730.
Sequence in context: A307161 A294560 A258977 * A121923 A212276 A000956
Adjacent sequences: A069039 A069040 A069041 * A069043 A069044 A069045
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Benoit Cloitre, Apr 06 2003
|
|
EXTENSIONS
|
More terms from Hans Havermann, Apr 07 2003
|
|
STATUS
|
approved
|
|
|
|