|
%I #9 Nov 21 2013 12:47:23
%S 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,
%T 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,
%U 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
%N Number of powers of 9 modulo n.
%H David W. Wilson, <a href="/A054717/b054717.txt">Table of n, a(n) for n = 1..1000</a>
%e 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.
%t With[{p9=9^Range[0,50]},Table[Length[Union[Mod[#,n]&/@p9]],{n,100}]] (* _Harvey P. Dale_, Apr 22 2012 *)
%K easy,nonn
%O 1,3
%A _Henry Bottomley_, Apr 20 2000
|
