proposed

approved

editing

proposed

These count the "starter sets" employed by a simple backtracking algorithm that computes A317624. See the PARI- program dated Sep 08-10 2018 under that entry.

proposed

editing

editing

proposed

These count the "starter sets" employed by a simple backtracking algorithm that computes A317624. See the PARI-program dated Sep 08-10 2018 under that entry.

A318670(n) = if(1==n, 1, my(ds=(divisors(n)[2..numdiv(n)]), subsets = select(v -> ((vecsum(v)<=n)&&(n==lcm(v))), powerset(ds))); length(subsets)); \\ VeryA naivememory-hog implementation.

<a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>

Antti Karttunen, <a href="/A318670/b318670.txt">Table of n, a(n) for n = 1..1259</a>

For all n >= 1:

a(A000961(n)) = 1.

a(A006881(n)) = 2.

For n = 45, there exists the following subsets of its divisors larger than one (3, 5, 9, 15, 45) that satisfy the condition that the least common multiple of the members is 45, and the sum does not exceed 45: (45), (3, 9, 15), (3, 5, 9, 15), (3, 5, 9)}, (), (5, 9), (9, 15) and (5, 9, 15), altogether seven subsets, thus a(45) = 7.