|
%I #10 May 03 2024 04:19:08
%S 1,3,4,7,6,12,8,15,13,9,2,18,4,14,14,21,8,29,10,15,13,6,4,30,11,12,20,
%T 26,10,26,4,24,8,14,18,41,8,20,16,27,5,29,5,14,28,12,8,44,17,19,16,21,
%U 6,41,12,40,20,20,10,40,7,12,28,30,15,24,8,26,16,32,8,60,8,17,26,31,16,38
%N Sum of the largest digit of the divisors of n.
%D J. Earls, "Black Hole 14," Mathematical Bliss, Pleroma Publications, 2009, pages 18-22. ASIN: B002ACVZ6O
%H Paolo Xausa, <a href="/A168338/b168338.txt">Table of n, a(n) for n = 1..10000</a>
%e a(16)=21 because the divisors of 16 are [1, 2, 4, 8, 16] and 1+2+4+8+6 = 21.
%t A168338[n_] := Total[Map[Max[IntegerDigits[#]] &, Divisors[n]]];
%t Array[A168338, 100] (* _Paolo Xausa_, May 03 2024 *)
%o (PARI) a(n)=sumdiv(n,d,vecmax(eval(Vec(Str(d))))) \\ _Charles R Greathouse IV_, May 22 2012
%Y Cf. A027750.
%K base,easy,nonn
%O 1,2
%A _Jason Earls_, Nov 23 2009
|
