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.

A272314 Number of representations of A067128(n), n>=2, as sum A067128(k)+A067128(t), k<=t, or a(n)=0 if there is no such expression.

Original entry on oeis.org

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

Views

Author

Vladimir Shevelev, May 10 2016

Keywords

Comments

The first zero terms calculated by Peter J. C. Moses appear for n=163,186,248,...

Crossrefs

Extensions

More terms from Peter J. C. Moses, May 10 2016