login
This site is supported by donations to The OEIS Foundation.

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

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
2, 17, 37, 1153, 1303 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..5.

CROSSREFS

Cf. A000364, A081730.

Sequence in context: A041965 A095075 A258977 * A121923 A212276 A000956

Adjacent sequences:  A069039 A069040 A069041 * A069043 A069044 A069045

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 06 2003

EXTENSIONS

More terms from Hans Havermann, Apr 07 2003

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified August 29 01:49 EDT 2015. Contains 261184 sequences.