login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A242310
Largest 1 < k <= A000005(n) such that the sum of k distinct divisors of n is equal to k*m for some m, or 1 if no such k exists.
0
1, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 5, 2, 2, 4, 3, 2, 5, 2, 6, 4, 4, 2, 7, 2, 2, 4, 5, 2, 8, 2, 4, 4, 3, 4, 8, 2, 4, 4, 7, 2, 8, 2, 6, 6, 4, 2, 11, 3, 4, 4, 5, 2, 8, 4, 8, 4, 2, 2, 12, 2, 4, 5, 6, 4, 8, 2, 6, 4, 8, 2, 11, 2, 2, 4, 4, 2, 8, 4, 2, 2, 11, 4, 4, 4
OFFSET
1,3
COMMENTS
k is the number of divisors of arithmetic numbers A003601.
EXAMPLE
a(12) = 5 because 1 + 2 + 4 + 6 + 12 = 25 = 5*5 for m = 5.
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved