id:A054703 - OEIS Search Results

Search: id:A054703

Displaying 1-1 of 1 results found.

page 1

Number of distinct powers of 2 modulo n.

+0
1

1, 2, 2, 3, 4, 3, 3, 4, 6, 5, 10, 4, 12, 4, 4, 5, 8, 7, 18, 6, 6, 11, 11, 5, 20, 13, 18, 5, 28, 5, 5, 6, 10, 9, 12, 8, 36, 19, 12, 7, 20, 7, 14, 12, 12, 12, 23, 6, 21, 21, 8, 14, 52, 19, 20, 6, 18, 29, 58, 6, 60, 6, 6, 7, 12, 11, 66, 10, 22, 13, 35, 9, 9, 37, 20, 20, 30, 13, 39, 8, 54 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A144909 A117114 A126688 this_sequence A048206 A075765 A014656` `Adjacent sequences: A054700 A054701 A054702 this_sequence A054704 A054705 A054706`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 20 2000`
	EXTENSIONS	`Improved definition from T. D. Noe, Jul 21 2008`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research