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

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, 24, 28, 15, 9, 24, 31, 21, 12, 16, 14, 23, 34, 25, 28, 23, 30, 29, 22, 32, 22, 24, 20, 27, 26, 15, 40, 34, 16, 20, 20, 29, 42, 45, 35, 12, 24, 40, 10, 21, 32, 60, 49

Offset: 1

Author

Paolo P. Lava, Sep 05 2014

Keywords

• nonn
• base
• less

Comments

Sum of the digits of the terms in row n of A130799.

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

Examples

			Anti-divisors of 20 are 3, 8, 13 and the sum of their digits is 3 + 8 + 1 + 3 = 15.
		

Links

• Paolo P. Lava, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A034690, A066272.

Programs

Maple

# function antidivisors defined in A066272. transforms is https://oeis.org/transforms.txt
read("transforms");
A246841 := proc(n)
    a :=0 ;
    for adiv in antidivisors(n) do
        a := a+digsum(adiv) ;
    end do:
    a ;
end proc:
seq(A246841(n),n=1..30) ; # R. J. Mathar, Sep 07 2014