OFFSET
1,2
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..100
FORMULA
a(n) = (1/n) * Sum_{d | n} totient(n/d) * A201549(d).
EXAMPLE
Some solutions for n=4:
.-3...-5...-3...-3...-4...-4...-5...-4...-2...-4...-4...-3...-3...-3...-3...-4
..0....2....1....0....3...-2....2....4....1....3....4....0....5....3....2....0
..3....5....2...-1....1....3...-2...-4....2....0...-1...-2....0...-1....1....4
..0...-2....0....4....0....3....5....4...-1....1....1....5...-2....1....0....0
MATHEMATICA
comps[r_, m_, k_] := Sum[(-1)^i*Binomial[r - 1 - i*m, k - 1]*Binomial[k, i], {i, 0, Floor[(r - k)/m]}]; a[n_Integer, k_] := DivisorSum[n, EulerPhi[n/#] comps[#*(k + 1), 2 k + 1, #] &]/n; a[n_] = a[n, 5]; Array[a, 22] (* Jean-François Alcover, Nov 01 2017, after Andrew Howroyd *)
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 29 2012
EXTENSIONS
a(15)-a(22) from Andrew Howroyd, Mar 02 2017
STATUS
approved