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.

A334671 Number of ways to write n as the sum of a squarefree number (A005117) and a square (A000290).

Original entry on oeis.org

1, 2, 2, 1, 2, 3, 3, 1, 1, 3, 4, 2, 1, 4, 4, 2, 3, 3, 4, 2, 3, 4, 5, 2, 1, 5, 4, 2, 2, 6, 5, 3, 3, 3, 6, 2, 4, 7, 7, 3, 3, 7, 5, 3, 2, 6, 7, 3, 2, 5, 7, 3, 3, 4, 7, 4, 4, 5, 7, 4, 2, 8, 5, 3, 4, 8, 7, 4, 5, 7, 9, 3, 4, 7, 7, 2, 5, 9, 6, 4, 3, 8, 10, 4, 3, 9, 10, 4, 4, 6
Offset: 1

Views

Author

Michel Marcus, Oct 31 2020

Keywords

Comments

Differs from A085263 where the square cannot be zero.

Crossrefs

Cf. A000290, A005117, A085263 (with a positive square).

Programs

  • PARI
    a(n) = sum(k=0, n, issquare(k) * issquarefree(n-k));