|
| |
|
|
A081730
|
|
Numbers n such that the n-th Euler number == 1 (mod n).
|
|
2
| |
|
|
1, 2, 3, 4, 5, 7, 8, 11, 13, 15, 16, 17, 19, 23, 29, 31, 32, 37, 41, 43, 47, 53, 59, 61, 64, 67, 71, 73, 79, 83, 89, 91, 97, 101, 103, 107, 109, 113, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| All primes, all power of 2 are in the sequence. The composites are in A035163.
|
|
|
PROG
| (PARI) for(i=200, 250, if(Mod(a(i), i)==1, print(i))) (Markham)
|
|
|
CROSSREFS
| Cf. A000364, A035163, A069042.
Sequence in context: A090467 A177202 A053868 * A162408 A162721 A176176
Adjacent sequences: A081727 A081728 A081729 * A081731 A081732 A081733
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2003
|
|
|
EXTENSIONS
| More terms from Weston Markham (weston.markham(AT)gmail.com), May 22 2005
|
| |
|
|
