id:A054717 - OEIS Search Results

Search: id:A054717

Displaying 1-1 of 1 results found.

page 1

Number of powers of 9 modulo n.

+0
1

1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 5, 2, 3, 3, 3, 2, 8, 2, 9, 2, 4, 5, 11, 2, 10, 3, 3, 3, 14, 3, 15, 4, 6, 8, 6, 2, 9, 9, 4, 2, 4, 4, 21, 5, 3, 11, 23, 3, 21, 10, 9, 3, 26, 3, 10, 3, 10, 14, 29, 3, 5, 15, 4, 8, 6, 6, 11, 8, 12, 6, 35, 2, 6, 9, 11, 9, 15, 4, 39, 2, 3, 4, 41, 4, 8, 21, 15, 5, 44, 3, 3 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`Take the sequence 1, 9, 81, 729, ... and reduce mod n; count distinct terms. For n = 5 we get 1, 4, 1, 4, ... so a(5) = 2.`
	CROSSREFS	`Sequence in context: A106487 A105102 A105105 this_sequence A086421 A109400 A000374` `Adjacent sequences: A054714 A054715 A054716 this_sequence A054718 A054719 A054720`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 20 2000`

page 1

Search completed in 0.002 seconds

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.

AT&T Labs Research