|
|
A200723
|
|
Bi-unitary Euler function of n.
|
|
1
|
|
|
1, 1, 3, 6, 10, 10, 21, 28, 36, 32, 55, 53, 78, 66, 69, 120, 136, 112, 171, 144, 153, 170, 253, 211, 300, 240, 351, 300, 406, 237, 465, 496, 384, 416, 445, 539, 666, 522, 558, 633, 820, 444, 903, 780, 772, 770, 1081, 887, 1176, 912, 951, 1104
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
FORMULA
|
a(6) = 1*1 + 4*1 +5*1 = 10 corresponding to the three 1's in row 6 of A165430.
|
|
MAPLE
|
local a, k ;
a := 0 ;
for k from 1 to n do
a := a+ k ;
end if;
end do;
a ;
end proc:
|
|
PROG
|
(Haskell)
a200723 = sum . zipWith (*) [1..] . map a063524 . a165430_row
(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
|
|
|
STATUS
|
approved
|
|
|
|