login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 22 22:13 EDT 2024. Contains 373619 sequences. (Running on oeis4.)