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.

A347710 Number of compositions (ordered partitions) of n into at most 3 squares.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 0, 1, 4, 2, 3, 1, 2, 6, 0, 1, 5, 4, 3, 2, 6, 3, 0, 3, 3, 8, 4, 0, 8, 6, 0, 1, 6, 5, 6, 4, 2, 9, 0, 2, 11, 6, 3, 3, 8, 6, 0, 1, 7, 9, 6, 2, 8, 12, 0, 6, 6, 2, 9, 0, 8, 12, 0, 1, 10, 12, 3, 5, 12, 6, 0, 4, 5, 14, 7, 3, 12, 6, 0, 2
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 10 2021

Keywords

Crossrefs

Formula

a(n) = Sum_{k=0..3} A337165(n,k). - Alois P. Heinz, Sep 10 2021