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.

A273515 The number of times n is rejected from the Stanley sequence S(0,1), A005836.

Original entry on oeis.org

0, 0, 4, 0, 0, 5, 4, 4, 5, 0, 0, 4, 0, 0, 6, 5, 5, 7, 4, 4, 12, 4, 4, 7, 5, 5, 6, 0, 0, 4, 0, 0, 5, 4, 4, 5, 0, 0, 4, 0, 0, 7, 6, 6, 9, 5, 5, 14, 5, 5, 10, 7, 7, 9, 4, 4, 12, 4, 4, 14, 12, 12, 14, 4, 4, 12, 4, 4, 9, 7, 7, 10, 5, 5, 14, 5, 5, 9, 6, 6, 7, 0, 0
Offset: 0

Views

Author

Max Barrentine, May 23 2016

Keywords

Comments

This sequence gives the number of times n is a member of an arithmetic triple aA005836. A005836 is the minimal sequence that disallows any arithmetic triples.

Links

Crossrefs

Cf. A005836, A262097, A273513, A273514, A273516.

Formula

a(n) = A273513(n) + A273514(n) + A262097(n).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.