Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069042
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069042 Numbers n such that the n-th Euler number (A000364) == 1 (mod n)^2. +0
2
2, 17, 37, 1153, 1303 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A000364, A081730.

Adjacent sequences: A069039 A069040 A069041 this_sequence A069043 A069044 A069045

Sequence in context: A041031 A041965 A095075 this_sequence A121923 A000956 A031906

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2003

EXTENSIONS

More terms from Hans Havermann, Apr 07 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research