OFFSET
1,3
COMMENTS
a(n) is the sum over all entries equal to 1 in row A165430(n.,), weighted by the column index.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Laszlo Toth, On the bi-unitary analogues of Euler's arithmetical function and the gcd-sum function J. Int. Seq. 12 (2009) # 09.5.2.
FORMULA
a(6) = 1*1 + 4*1 +5*1 = 10 corresponding to the three 1's in row 6 of A165430.
MAPLE
PROG
(Haskell)
a200723 = sum . zipWith (*) [1..] . map a063524 . a165430_row
-- Reinhard Zumkeller, Mar 04 2013
(PARI) udivs(n) = {my(d = divisors(n)); select(x->(gcd(x, n/x)==1), d); }
a(n) = sum(k=1, n, if (vecmax(setintersect(udivs(n), udivs(k))) == 1, k)); \\ Michel Marcus, Jun 28 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. J. Mathar, Nov 21 2011
STATUS
approved