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.

A375957 Number of partitions of [n] such that the element sum of each block is one more than a multiple of ten.

Original entry on oeis.org

1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 5, 6, 0, 1, 5005, 0, 32352, 215511, 1, 160, 1600, 1937, 52374735, 11374351128, 100368000, 248032486000, 677497393, 5166569025792, 84527951721264, 154849134310100, 774245674466500, 18868327574531760, 201758301050363904, 40887062103450025
Offset: 0

Views

Author

Alois P. Heinz, Sep 03 2024

Keywords

Examples

			a(6) = 1: 123456.
a(9) = 1: 1|29|38|47|56.
a(10) = 5: 1(10)|29|38|47|56, 1|29(10)|38|47|56, 1|29|38(10)|47|56, 1|29|38|47(10)|56, 1|29|38|47|56(10).
a(11) = 6: 1(10)|29|38|47|56|(11), 1|29(10)|38|47|56|(11), 1|29|38(10)|47|56|(11), 1|29|38|47(10)|56|(11), 1|29|38|47|56(10)|(11), 1|29|38|47|56|(10)(11).
		

Crossrefs

Column k=10 of A375924.