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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098936 Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n. 0
 6671, 6673, 7931, 7941, 7945, 7947, 7949, 7951, 7953, 7957, 7959, 7973, 7979, 8113, 8117, 8125, 8127, 8135, 8139, 8141, 8183, 8193, 8195, 8199, 8201, 8205, 8207, 8211, 8213, 8215, 8217, 8269, 8325, 8331, 8335, 8341, 8343, 8345, 8351, 8353, 8357, 8359 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES Berndt, Bruce C.; Yee, Ae Ja; Zaharescu, Alexandru New theorems on the parity of partition functions. J. Reine Angew. Math. 566 (2004), 91-109. MR2039324 LINKS MATHEMATICA Flatten[Position[Accumulate[Table[If[EvenQ[PartitionsP[n]], 1, -1], {n, 0, 8400}]], _?(#==0&)]]-1 (* Harvey P. Dale, Aug 25 2020 *) PROG (PARI) lista(n) = {ne = 0; no = 0; for (i=0, n, if (numbpart(i) % 2, no++, ne++); if (ne == no, print1(i, ", "); ); ); } \\ Michel Marcus, Aug 15 2013 CROSSREFS Cf. A000041. Sequence in context: A043516 A046410 A326811 * A345601 A345860 A206008 Adjacent sequences:  A098933 A098934 A098935 * A098937 A098938 A098939 KEYWORD nonn AUTHOR Kevin O'Bryant, Oct 20 2004 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 December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)