|
Search: id:A066800
|
|
|
| A066800 |
|
Number of different eventual period lengths for power sequences mod n; i.e. number of different period lengths of repeating digits of 1/n in different bases. |
|
+0
2
|
|
| 1, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 4, 3, 3, 5, 4, 6, 3, 4, 4, 4, 2, 6, 6, 6, 4, 6, 3, 8, 4, 4, 5, 6, 4, 9, 6, 6, 3, 8, 4, 8, 4, 6, 4, 4, 3, 8, 6, 5, 6, 6, 6, 6, 4, 6, 6, 4, 3, 12, 8, 4, 5, 6, 4, 8, 5, 4, 6, 8, 4, 12, 9, 6, 6, 8, 6, 8, 3, 8, 8, 4, 4, 5, 8, 6, 4, 8, 6, 6, 4, 8, 4, 9, 4, 12, 8, 8, 6, 9, 5, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
Number of divisors of reduced totient function: a(n) = A000005(A002322(n)).
|
|
EXAMPLE
|
Modulo 5, powers of 1,6,11 etc. are 1,1,1,1,1,1,...; of 2,7,12 etc. are 1,2,4,3,1,2,4,3,...; of 3,8,13 etc. are 1,3,4,2,1,3,4,2,...; of 4,9,14 etc. are 1,4,1,4,1,4,...; of 5,10,15 etc. are 1,0,0,0,0,... So the eventual period lengths are 1,4,4,2,1 giving three distinct lengths, so a(n)=3.
|
|
CROSSREFS
|
This is the number of different values of rows of the square array A066799.
Sequence in context: A122667 A122668 A073668 this_sequence A114102 A144373 A086292
Adjacent sequences: A066797 A066798 A066799 this_sequence A066801 A066802 A066803
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Dec 20 2001
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Nov 14 2002
|
|
|
Search completed in 0.002 seconds
|
