The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328041 Number of parts in all proper floor(n/2)-times partitions of n. 2
 0, 1, 2, 5, 21, 61, 461, 1652, 17487, 76264, 1002835, 5207742, 88664398, 515821495, 10184805624, 69200406679, 1610282904928, 12024183111167, 318978837371853, 2653055962437988, 79332250069994262, 725413309833320933, 23919660963588169669, 238830233430136549070 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..300 FORMULA a(n) = A327631(n,floor(n/2)). MAPLE b:= proc(n, i, k) option remember; `if`(n=0, [1, 0],      `if`(k=0, [1, 1], `if`(i<2, 0, b(n, i-1, k))+          (h-> (f-> f +[0, f[1]*h[2]/h[1]])(h[1]*         b(n-i, min(n-i, i), k)))(b(i\$2, k-1))))     end: a:= n-> (k-> add(b(n\$2, i)[2]*(-1)^(k-i)         *binomial(k, i), i=0..k))(iquo(n, 2)): seq(a(n), n=0..23); CROSSREFS Cf. A327631. Sequence in context: A246167 A000941 A000131 * A242785 A228385 A152801 Adjacent sequences:  A328038 A328039 A328040 * A328042 A328043 A328044 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 02 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 25 06:30 EDT 2020. Contains 337335 sequences. (Running on oeis4.)