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.

A348522 Number of partitions of n into two or more cubes.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 17, 17, 18, 18, 18, 19, 19, 21, 21, 21, 22, 22, 22, 23, 23, 25
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 21 2021

Keywords

Crossrefs

Programs

  • PARI
    cubes_less_than(n) = { my(lista=List([]),i=1,k=1); while(kA348522(n) = if(n<2,0,partitions_into_with_trailing_ones(n, cubes_less_than(n))); \\ Antti Karttunen, Oct 31 2021
Showing 1-1 of 1 results.