id:A092188 - OEIS Search Results

Search: id:A092188

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest positive integer m such that 2^3^4^5^...^n == m mod n.

+0
4

2, 2, 4, 2, 2, 1, 8, 8, 2, 2, 8, 5, 8, 2, 16, 2, 8, 18, 12, 8, 2, 16, 8, 2, 18, 26, 8, 11, 2, 2, 32, 2, 2, 22, 8, 31, 18, 5, 32, 2, 8, 27, 24, 17, 16, 8, 32, 43, 2, 2, 44, 45, 26, 2, 8, 56, 40, 47, 32, 33, 2, 8, 64, 57, 2, 5, 36, 62, 22, 60, 8, 1, 68, 2, 56, 57, 44, 8, 32, 80, 2, 2, 8, 2, 70 (list; graph; listen)

	OFFSET	`2,1`
	LINKS	`R. Munafo, Smallest positive integer m such that 2^3^4^5^...^n == m mod n`
	EXAMPLE	`2^3^4^5 = 2^3^1024. But 3 == -1 mod 4, so 3^1024 == 1 mod 4, so 2^3^1024 == 2^1 mod 5 (since 2^4 == 1 mod 5) == 2 = a(5).`
	CROSSREFS	`Sequence in context: A033726 A126768 A021450 this_sequence A097884 A094818 A114233` `Adjacent sequences: A092185 A092186 A092187 this_sequence A092189 A092190 A092191`
	KEYWORD	`nonn,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), following a suggestion of J. H. Conway, Apr 02 2004`
	EXTENSIONS	`More terms from Robert Munafo (mrob(AT)mrob.com), Apr 11 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research