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”).

A343246
Number of partitions of n into 3 parts where at least one part divides another.
3
0, 0, 1, 1, 2, 3, 4, 5, 7, 7, 10, 10, 14, 14, 17, 17, 22, 20, 27, 24, 29, 30, 37, 31, 41, 40, 45, 42, 53, 43, 59, 54, 61, 60, 66, 56, 78, 73, 78, 70, 90, 74, 98, 86, 92, 96, 110, 87, 113, 103, 116, 109, 132, 110, 129, 118, 135, 136, 153, 115, 162, 150, 151, 147, 165, 145
OFFSET
1,5
FORMULA
a(n) = Sum_{j=1..floor(n/3)} Sum_{i=j..floor((n-j)/2)} sign(c(i/j) + c((n-i-j)/j) + c((n-i-j)/i)), where c(n) = 1 - ceiling(n) + floor(n).
CROSSREFS
Cf. A343126.
Sequence in context: A320466 A342542 A338671 * A348531 A237824 A227972
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Apr 08 2021
STATUS
approved