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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 13:19 EST 2016. Contains 278750 sequences.