The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS k is the number of divisors of arithmetic numbers A003601. LINKS EXAMPLE a(12) = 5 because 1 + 2 + 4 + 6 + 12 = 25 = 5*5 for m = 5. CROSSREFS Cf. A000203, A003601, A049642. Sequence in context: A027389 A111735 A211454 * A102298 A049298 A075016 Adjacent sequences:  A242307 A242308 A242309 * A242311 A242312 A242313 KEYWORD nonn AUTHOR Ilya Lopatin and Juri-Stepan Gerasimov, May 10 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 17:45 EDT 2020. Contains 337444 sequences. (Running on oeis4.)