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.

A025447 Number of partitions of n into 3 nonnegative cubes.

Original entry on oeis.org

1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Keywords

Programs

  • PARI
    a(n)=sum(a=0,sqrtnint(n,3), sum(b=0,a, my(C=n-a^3-b^3,c); ispower(C,3,&c) && 0 <= c && c <= b)) \\ Charles R Greathouse IV, Jun 26 2013
    
  • PARI
    a(n)=sum(a=0,sqrtnint(n,3), my(a3=a^3,c); sum(b=0,min(a,sqrtnint(n-a3,3)), ispower(n-a3-b^3,3,&c) && c <= b)) \\ Charles R Greathouse IV, Sep 16 2016