A080210 Lower bound for the multiplicity of a disjoint covering system of congruences.

1, 2, 3, 2, 5, 2, 7, 2, 3, 3, 11, 2, 13, 4, 3, 2, 17, 2, 19, 3, 5, 6, 23, 2, 5, 7, 3, 4, 29, 2, 31, 2, 7, 9, 5, 2, 37, 10, 9, 3, 41, 3, 43, 6, 3, 12, 47, 2, 7, 3, 11, 7, 53, 2, 9, 4, 13, 15, 59, 2, 61, 16, 5, 2, 10, 4, 67, 9, 15, 3, 71, 2, 73, 19, 3, 10, 9, 5, 79, 3, 3, 21, 83, 3, 13, 22, 19, 6, 89

Offset

1,2

Links

Table of n, a(n) for n=1..89.

T. Zamojski, Survey on covering congruences.

Formula

a(n) = floor(Lpf(n)*phi(n)/n) + 1 where Lpf(n) is the largest prime factor of n and phi is the Euler totient function.

Crossrefs

Cf. A080340.

Sequence in context: A134332 A276632 A273288 * A126594 A363895 A086765

Adjacent sequences: A080207 A080208 A080209 * A080211 A080212 A080213

Keyword

nonn

Author

Benoit Cloitre, Mar 20 2003

Status

approved