A324864 a(n) is the maximal value that A324862(d) attains among the divisors d of n.

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, 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, 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

Offset: 1

Author

Antti Karttunen, Mar 21 2019

Keywords

• nonn

Examples

			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.
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.
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.
		

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)
• Index entries for sequences related to binary expansion of n
• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to sigma(n)

Crossrefs

Cf. A324862, A324863, A324869 (gives the count of how many times the largest value occurs).

Programs

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); };

Formula

a(n) = Max_{d|n} A324862(d).

a(p) = 0 for all primes p.