|
Search: id:A071126
|
|
|
| A071126 |
|
Length of least repunit which is a multiple of the n-th prime, or 0 if no such multiple exists. |
|
+0
6
|
|
| 0, 3, 0, 6, 2, 6, 16, 18, 22, 28, 15, 3, 5, 21, 46, 13, 58, 60, 33, 35, 8, 13, 41, 44, 96, 4, 34, 53, 108, 112, 42, 130, 8, 46, 148, 75, 78, 81, 166, 43, 178, 180, 95, 192, 98, 99, 30, 222, 113, 228, 232, 7, 30, 50, 256, 262, 268, 5, 69, 28, 141, 146, 153, 155, 312, 79, 110
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Amarnath Murthy, On the divisors of Smarandache Unary Sequence. Smarandache Notions Journal, Vol. 11, 2000.
|
|
LINKS
|
P. De Geest, Repunits and Their Factors
A. A. A. Steward, Factorization of Repunits[up to R(196)]
|
|
FORMULA
|
If prime(n) = p then a(n) is a divisor of p-1. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 11 2002
|
|
EXAMPLE
|
The 13-th prime, 41, divides the repunit 11111, the smallest among all R(5k) which are multiples of 41.
|
|
CROSSREFS
|
Number of 1's in A077573(n).
Cf. A000042. Apart from a(2), identical to A002371.
Sequence in context: A111074 A007384 A077574 this_sequence A077187 A011079 A005928
Adjacent sequences: A071123 A071124 A071125 this_sequence A071127 A071128 A071129
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), May 28 2002
|
|
|
Search completed in 0.002 seconds
|
