Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Mar 27 2019 18:56:25
%S 0,0,0,1,0,1,0,1,3,0,0,1,0,1,4,4,0,3,0,1,5,1,0,1,0,1,4,1,0,4,0,4,0,1,
%T 5,4,0,1,7,1,0,5,0,1,4,1,0,4,0,0,2,1,0,4,6,1,9,1,0,4,0,1,5,6,0,1,0,1,
%U 0,5,0,5,0,1,5,1,6,7,0,4,4,1,0,5,8,1,11,1,0,6,7,1,0,1,9,5,0,1,7,5,0,2,0,1,6
%N a(n) is the maximal value that A324862(d) attains among the divisors d of n.
%H Antti Karttunen, <a href="/A324864/b324864.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F a(n) = Max_{d|n} A324862(d).
%F a(p) = 0 for all primes p.
%e Divisors of 8 are [1, 2, 4, 8]. A324862 applied to these gives values [0, 0, 1, 0], of which the largest is 1, thus a(8) = 1.
%e Divisors of 81 are [1, 3, 9, 27, 81]. A324862 applied to these gives values [0, 0, 3, 4, 0], of which 4 is the largest, thus a(81) = 4.
%e Divisors of 88 are [1, 2, 4, 8, 11, 22, 44, 88]. A324862 applied to these gives values [0, 0, 1, 0, 0, 1, 1, 0], of which the largest is 1, thus a(88) = 1.
%o (PARI) A324864(n) = { my(m=0,w,c=0); fordiv(n,d,w=A324862(d); if(w>=m,if(w==m,c++,c=1;m=w))); (m); };
%Y Cf. A324862, A324863, A324869 (gives the count of how many times the largest value occurs).
%K nonn
%O 1,9
%A _Antti Karttunen_, Mar 21 2019