|
Search: id:A118107
|
|
|
| A118107 |
|
Period of the vector sequence d(n)^2^k mod n for k=1,2,3,..., where d(n) is the vector of divisors of n. |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 4, 1, 2, 2, 1, 6, 2, 1, 1, 2, 1, 4, 2, 10, 1, 1, 1, 4, 1, 2, 1, 6, 4, 2, 6, 3, 1, 1, 1, 4, 2, 1, 1, 4, 1, 1, 10, 2, 1, 2, 1, 6, 4, 6, 4, 2, 1, 1, 1, 4, 1, 2, 1, 3, 3, 4, 1, 2, 2, 10, 4, 11, 6, 1, 1, 6, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,14
|
|
|
COMMENT
|
This sequence is related to the period of sigma_(2^k)(n) mod n, which is important in verifying the n dividing sigma_(2^k)(n) for all k>0. See A066292 and A118076. Note that a(n)=1 if n is a power of a prime.
|
|
EXAMPLE
|
See A118106 for an example involving d(n)^k.
|
|
MATHEMATICA
|
Table[d=Divisors[n]; k=0; found=False; While[i=0; While[i<k-1 && !found, i++; found=(dk[i]==dk[k])]; !found, k++; dk[k]=PowerMod[d, 2^k, n]]; k-i, {n, 100}]
|
|
CROSSREFS
|
Cf. A118106 (period of the vector sequence d(n)^k mod n).
Sequence in context: A122191 A097847 A107435 this_sequence A055652 A133831 A066955
Adjacent sequences: A118104 A118105 A118106 this_sequence A118108 A118109 A118110
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Apr 13 2006
|
|
|
Search completed in 0.002 seconds
|
