login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069042 Numbers n such that the n-th Euler number (A000364) == 1 (mod n^2). 1

%I

%S 2,17,37,1153,1303

%N Numbers n such that the n-th Euler number (A000364) == 1 (mod n^2).

%t Select[Range[2, 10000], Divisible[Abs[EulerE[2*#]] - 1, #^2] &] (* _Amiram Eldar_, Jun 03 2017 *)

%Y Cf. A000364, A081730.

%K nonn,more

%O 1,1

%A _Benoit Cloitre_, Apr 06 2003

%E More terms from _Hans Havermann_, Apr 07 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 12:26 EDT 2021. Contains 345080 sequences. (Running on oeis4.)