id:A081730 - OEIS Search Results

Search: id:A081730

Displaying 1-1 of 1 results found.

page 1

Numbers n such that the n-th Euler number == 1 (mod n).

+0
3

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; listen)

	OFFSET	`1,2`
	FORMULA	`All primes, all power of 2 are in the sequence. The composites are in A035163.`
	PROGRAM	`(PARI) for(i=200, 250, if(Mod(a(i), i)==1, print(i))) (Markham)`
	CROSSREFS	`Cf. A000364, A035163, A069042.` `Sequence in context: A058586 A090467 A053868 this_sequence A020902 A008751 A029002` `Adjacent sequences: A081727 A081728 A081729 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research