OFFSET
0,4
COMMENTS
Is there only one case of nonzero adjacent equal parts, at position n = 6?
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..10000
EXAMPLE
We have 19 = 4*3 + 1*7, so the pair (3,7) is counted under a(19).
The a(2) = 1 through a(7) = 14 pairs:
(1,2) (1,2) (1,2) (1,2) (1,2) (1,2)
(1,3) (1,3) (1,3) (1,3) (1,3)
(2,3) (1,4) (1,4) (1,4) (1,4)
(2,3) (1,5) (1,5) (1,5)
(2,4) (2,3) (1,6) (1,6)
(3,4) (2,5) (2,3) (1,7)
(3,5) (2,4) (2,3)
(4,5) (2,5) (2,5)
(2,6) (2,7)
(3,4) (3,4)
(3,5) (3,7)
(3,6) (4,7)
(4,6) (5,7)
(5,6) (6,7)
MATHEMATICA
combs[n_, y_]:=With[{s=Table[{k, i}, {k, y}, {i, 0, Floor[n/k]}]}, Select[Tuples[s], Total[Times@@@#]==n&]];
Table[Length[Select[Subsets[Range[n], {2}], combs[n, #]!={}&]], {n, 0, 30}]
PROG
(Python)
from itertools import count
from sympy import divisors
def A365314(n):
a = set()
for i in range(1, n+1):
if not n%i:
a.update(tuple(sorted((i, j))) for j in range(1, n+1) if j!=i)
else:
for j in count(0, i):
if j > n:
break
k = n-j
for d in divisors(k):
if d>=i:
break
a.add((d, i))
return len(a) # Chai Wah Wu, Sep 12 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 05 2023
STATUS
approved