cp's OEIS Frontend

A246841 Sum of digits of all the anti-divisors of n.

%I A246841 #14 Sep 08 2014 18:30:40
%S A246841 0,0,2,3,5,4,10,8,8,14,12,13,19,16,9,5,19,19,9,15,13,27,25,14,21,15,
%T A246841 24,28,15,9,24,31,21,12,16,14,23,34,25,28,23,30,29,22,32,22,24,20,27,
%U A246841 26,15,40,34,16,20,20,29,42,45,35,12,24,40,10,21,32,60,49
%N A246841 Sum of digits of all the anti-divisors of n.
%C A246841 Sum of the digits of the terms in row n of A130799.
%C A246841 First occurrence of k, or 0 if k never appears: 0, 3, 4, 6, 5, 0, 0, 8, 15, 7, 0, 11, 12, 10, 20, 14, 75, 69, 13, 48, 25, 44, 37, 27, 23, 50, 22, 28, 43, 42, 32, 45, 92, 38, 60, 82, 208, 81, 110, 52, 72, 58, 97, 73, 59, 77, 255, 85, 68, 127,  ...
%H A246841 Paolo P. Lava, <a href="/A246841/b246841.txt">Table of n, a(n) for n = 1..1000</a>
%e A246841 Anti-divisors of 20 are 3, 8, 13 and the sum of their digits is 3 + 8 + 1 + 3 = 15.
%p A246841 # function antidivisors defined in A066272. transforms is https://oeis.org/transforms.txt
%p A246841 read("transforms");
%p A246841 A246841 := proc(n)
%p A246841     a :=0 ;
%p A246841     for adiv in antidivisors(n) do
%p A246841         a := a+digsum(adiv) ;
%p A246841     end do:
%p A246841     a ;
%p A246841 end proc:
%p A246841 seq(A246841(n),n=1..30) ; # _R. J. Mathar_, Sep 07 2014
%Y A246841 Cf. A034690, A066272.
%K A246841 nonn,base,less
%O A246841 1,3
%A A246841 _Paolo P. Lava_, Sep 05 2014