|
Search: id:A064123
|
|
|
| A064123 |
|
Number of divisors of 5^n - 1 that are relatively prime to 5^m - 1 for all 0 < m < n. |
|
+0
1
|
|
| 3, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 4, 4, 4, 4, 2, 8, 4, 4, 8, 4, 2, 16, 4, 16, 2, 8, 4, 4, 4, 4, 4, 16, 4, 8, 8, 4, 4, 4, 8, 4, 4, 8, 4, 2, 2, 2, 4, 8, 4, 8, 8, 16, 2, 2, 4, 4, 4, 8, 8, 8, 8, 8, 4, 32, 16, 16, 4, 4, 8, 8, 8, 32, 4, 8, 4, 8, 4, 4, 16, 8, 4, 8, 16, 8, 2, 64, 2, 4, 2, 8, 8, 16, 4, 8, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,119
Sam Wagstaff, Cunningham Project, Factorizations of 5^n-1, n odd, n<376
|
|
MATHEMATICA
|
a = {1}; Do[ d = Divisors[ 5^n - 1 ]; l = Length[ d ]; c = 0; k = 1; While[ k < l + 1, If[ Union[ GCD[ a, d[ [ k ] ] ] ] == {1}, c++ ]; k++ ]; Print[ c ]; a = Union[ Flatten[ Append[ a, Transpose[ FactorInteger[ 5^n - 1 ] ][ [ 1 ] ] ] ] ], {n, 1, 58} ]
|
|
PROGRAM
|
(PARI) { allocatemem(932245000); for (n=1, 119, d=divisors(5^n - 1); l=length(d); a=0; for (i=1, l, t=1; for (m=1, n - 1, p=5^m - 1; if (gcd(d[i], p)!=1, t=0; break)); if (t, a++)); write("b064123.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 08 2009]
|
|
CROSSREFS
|
Cf. A063982.
Sequence in context: A067279 A096101 A104890 this_sequence A024703 A102845 A064126
Adjacent sequences: A064120 A064121 A064122 this_sequence A064124 A064125 A064126
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 10 2001
|
|
EXTENSIONS
|
More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 08 2009
|
|
|
Search completed in 0.002 seconds
|
