id:A162018 - OEIS Search Results

Search: id:A162018

Displaying 1-1 of 1 results found.

page 1

A162018

Numbers n for which 2^^n != 2^2^n mod n; for the "^^" notation see A092188.

+0
2

7, 9, 11, 13, 19, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 38, 39, 41, 45, 47, 49, 50, 53, 54, 55, 57, 59, 61, 62, 63, 65, 66, 67, 69, 71, 73, 74, 75, 77, 79, 81, 82, 83, 86, 87, 89, 91, 92, 93, 94, 95, 97, 98, 99, 101, 103, 105, 106, 107, 108, 109, 110, 111, 113, 114, 115 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`Robert Munafo, 2^^N == 2^(2^N) mod N`
	EXAMPLE	`7 is in the sequence because 2^2^7 = 2^128 == 4 mod 7, but 2^^7 = 2^2^2^2^2^2^2 == 2 mod 7.`
	CROSSREFS	`Cf. A092188, A162002, A014221` `Sequence in context: A059808 A020742 A023389 this_sequence A055741 A103621 A081239` `Adjacent sequences: A162015 A162016 A162017 this_sequence A162019 A162020 A162021`
	KEYWORD	`easy,nonn`
	AUTHOR	`Robert Munafo (mrob27(AT)gmail.com), Jun 24 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research