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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306956 Sum over all partitions of n into distinct parts of the LCM of the parts. 3
 1, 1, 2, 5, 7, 15, 21, 39, 58, 90, 142, 218, 325, 465, 695, 948, 1411, 1977, 2883, 3940, 5415, 7422, 10126, 14091, 18947, 25666, 34282, 45890, 60710, 82211, 108510, 142960, 185271, 240595, 315158, 409231, 531967, 688689, 880997, 1126451, 1447754, 1849743 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..200 Wikipedia, Partition (number theory) FORMULA a(n) mod 2 = A040051(n). a(n) is even <=> n in { A001560 }. a(n) is odd <=> n in { A052002 }. MAPLE b:= proc(n, i, r) option remember; `if`(i*(i+1)/2 b(n\$2, 1): seq(a(n), n=0..44); MATHEMATICA b[n_, i_, r_] := b[n, i, r] = If[i(i+1)/2 < n, 0, If[n == 0, r, b[n, i-1, r] + b[n-i, Min[i-1, n-i], LCM[i, r]]]]; a[n_] := b[n, n, 1]; Table[a[n], {n, 0, 44}] (* Jean-François Alcover, Mar 20 2019, translated from Maple *) CROSSREFS Cf. A000009, A000041, A001560, A040051, A052002, A181844, A319301. Sequence in context: A245921 A215513 A358878 * A337655 A366175 A111328 Adjacent sequences: A306953 A306954 A306955 * A306957 A306958 A306959 KEYWORD nonn AUTHOR Alois P. Heinz, Mar 17 2019 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.

Last modified September 12 11:08 EDT 2024. Contains 375850 sequences. (Running on oeis4.)