login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A340279
Number of partitions of n into 3 parts such that the smallest part is relatively prime to at least one other part.
2
0, 0, 1, 1, 2, 2, 4, 4, 6, 6, 10, 8, 14, 12, 16, 16, 24, 18, 30, 24, 32, 30, 43, 32, 49, 42, 54, 48, 68, 48, 78, 64, 80, 72, 93, 72, 110, 90, 111, 96, 134, 96, 148, 120, 144, 132, 175, 128, 187, 150, 189, 168, 221, 162, 230, 191, 236, 209, 273, 192, 293, 239, 285, 255
OFFSET
1,5
FORMULA
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} sign(floor(1/gcd(k,i)) + floor(1/gcd(k,n-i-k))).
MATHEMATICA
Table[Sum[Sum[Sign[Floor[1/GCD[k, i]] + Floor[1/GCD[k, n - i - k]]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 80}]
CROSSREFS
Sequence in context: A328422 A029009 A340280 * A343100 A023023 A184157
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jan 02 2021
STATUS
approved