cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A331848 Number of partitions of n into odd parts with some part repeated.

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 3, 4, 4, 6, 8, 10, 12, 15, 19, 23, 27, 33, 41, 48, 57, 68, 81, 95, 111, 130, 153, 178, 206, 239, 278, 320, 367, 423, 486, 556, 635, 725, 827, 941, 1067, 1211, 1374, 1553, 1753, 1980, 2232, 2512, 2823, 3171, 3560, 3990, 4465, 4995, 5585, 6234, 6951, 7749
Offset: 0

Views

Author

Ilya Gutkovskiy, Jan 29 2020

Keywords

Comments

Also number of partitions of n into distinct parts with at least one even part.

Examples

			a(6) = 3 because we have [3, 3], [3, 1, 1, 1] and [1, 1, 1, 1, 1, 1].
		

Crossrefs

Formula

a(n) = A000009(n) - A000700(n).
Showing 1-1 of 1 results.