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!)
 A341879 a(n) is the largest d(k) such that sigma(k) = n, where d is the number of divisor function and sigma is the sum of divisors function. 1
 1, 0, 2, 2, 0, 2, 3, 2, 0, 0, 0, 4, 3, 2, 4, 0, 0, 4, 0, 2, 0, 0, 0, 4, 0, 0, 0, 6, 0, 2, 5, 4, 0, 0, 0, 4, 0, 2, 6, 4, 0, 6, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 6, 3, 0, 0, 8, 0, 2, 6, 0, 0, 0, 0, 2, 0, 0, 0, 8, 0, 2, 0, 0, 0, 6, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 9, 0, 6, 0, 0, 8, 0, 6, 0, 0, 0, 2, 0, 6, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 EXAMPLE k that satisfies sigma(k) = 12 is 6 or 11. d(6) = 4 and d(11) = 2. So a(12) = 4. PROG (PARI) a(n) = my(m=0); for(k=1, n, if(sigma(k)==n, m=max(m, numdiv(k)))); m; CROSSREFS Cf. A000005, A000203, A054973, A057637, A085790, A299762. Sequence in context: A328903 A143539 A249063 * A099307 A256750 A228430 Adjacent sequences:  A341876 A341877 A341878 * A341880 A341881 A341882 KEYWORD nonn,easy AUTHOR Seiichi Manyama, Feb 22 2021 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 April 19 07:26 EDT 2021. Contains 343109 sequences. (Running on oeis4.)