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-2 of 2 results.

A344318 Number of partitions of n into consecutive parts not divisible by 3.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, 1, 1, 1, 3, 1, 3, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 3, 3, 2, 1, 1, 2, 1, 3, 1, 3, 1, 2, 1, 3, 3, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 4, 1, 3, 2, 1, 1, 2, 4, 1, 2, 1, 2, 3, 1, 2, 1, 3, 2, 4
Offset: 1

Views

Author

Ilya Gutkovskiy, May 14 2021

Keywords

Examples

			a(34) = 3 because we have [34], [13, 11, 10] and [10, 8, 7, 5, 4].
		

Crossrefs

A344320 Number of partitions of n into consecutive parts not divisible by 5.

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 3, 1, 2, 2, 3, 1, 1, 2, 2, 2, 3, 2, 2, 1, 2, 3, 1, 3, 2, 2, 2, 2, 2, 2, 3, 1, 3, 3, 2, 1, 3, 1, 3, 1, 4, 2, 1, 3, 3, 1, 4, 2, 2, 1, 3, 2, 2, 4, 1, 3, 3, 1, 2, 4, 3, 1, 2, 3, 1, 2, 4, 2, 4, 2, 3, 2, 1, 3, 2, 1, 4, 4, 2, 1, 3, 2, 2, 5
Offset: 1

Views

Author

Ilya Gutkovskiy, May 14 2021

Keywords

Examples

			a(13) = 3 because we have [13], [7, 6] and [6, 4, 3].
		

Crossrefs

Showing 1-2 of 2 results.