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!)
A329322 a(n) is the total number of even parts in all partitions of n into consecutive parts. 2
0, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 2, 1, 3, 5, 1, 1, 4, 1, 4, 6, 3, 1, 2, 3, 3, 6, 4, 1, 7, 1, 1, 6, 3, 7, 6, 1, 3, 6, 4, 1, 7, 1, 5, 12, 3, 1, 2, 5, 6, 6, 5, 1, 9, 8, 4, 6, 3, 1, 9, 1, 3, 14, 1, 8, 9, 1, 5, 6, 9, 1, 7, 1, 3, 13, 5, 11, 10, 1, 4, 10, 3, 1, 9, 8, 3, 6, 6, 1, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = A204217(n) - A329321(n).
EXAMPLE
For n = 15 there are four partitions of 15 into consecutive part, they are [15], [8, 7], [6, 5, 4], [5, 4, 3, 2, 1]. In total there are five even parts, they are [8, 6, 4, 4, 2], so a(15) = 5.
PROG
(PARI) A329322(n) = { my(i=2, t=!(n%2)); n--; while(n>0, if(!(n%i), t += (!((n/i)%2)+i)\2); n-=i; i++); t }; \\ (After David A. Corneth's program for A204217) - Antti Karttunen, Dec 09 2021
CROSSREFS
Cf. A204217 (total number of parts).
Sequence in context: A364812 A129453 A129455 * A067924 A344912 A056670
KEYWORD
nonn
AUTHOR
Omar E. Pol, Nov 10 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:24 EDT 2024. Contains 371955 sequences. (Running on oeis4.)