id:A068535 - OEIS Search Results

Search: id:A068535

Displaying 1-1 of 1 results found.

page 1

Numbers n such that 2^n (mod n) = 2^n (mod n^2).

+0
4

1, 2, 4, 8, 16, 32, 35, 64, 128, 256, 297, 512, 1024, 1093, 2048, 2186, 2590, 3279, 3511, 4096, 4372, 5465, 6558, 7022, 7651, 8192, 8744, 9837, 10533, 10930, 13116, 14044, 14209, 16384, 21066, 23175, 24012, 24577, 26592, 28088, 31599, 32768 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Sequence contains all numbers of the form 2^k but also many others as the subsequence of primes in A001220(n).`
	CROSSREFS	`Adjacent sequences: A068532 A068533 A068534 this_sequence A068536 A068537 A068538` `Sequence in context: A141031 A045603 A072011 this_sequence A051505 A101434 A008382`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 22 2002`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research