id:A080210 - OEIS Search Results

Search: id:A080210

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`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.` `Adjacent sequences: A080207 A080208 A080209 this_sequence A080211 A080212 A080213` `Sequence in context: A067695 A079866 A134332 this_sequence A126594 A086765 A079868`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 20 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research