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.

A267300 Earliest positive increasing sequence having no 5-term subsequence with constant second differences.

Original entry on oeis.org

0, 1, 2, 3, 5, 6, 7, 8, 11, 13, 16, 19, 20, 22, 24, 30, 31, 36, 45, 46, 52, 55, 60, 62, 63, 66, 69, 71, 75, 86, 89, 92, 103, 111, 115, 119, 134, 137, 145, 152, 163, 176, 178, 179, 196, 200, 220, 223, 275, 276, 278, 281, 282, 284, 286, 294, 304, 316, 319, 326, 339, 353, 360, 363, 376, 379, 384, 390, 402, 414, 423, 429, 442
Offset: 1

Views

Author

M. F. Hasler, Jan 12 2016

Keywords

Crossrefs

Cf. A267301 (positive variant: starting with 1).
No 3-term AP: A005836 (>=0), A003278 (>0);
no 4-term AP: A240075 (>=0), A240555 (>0);
no 5-term AP: A020654 (>=0), A020655 (>0);
no 6-term AP: A020656 (>=0), A005838 (>0);
no 7-term AP: A020657 (>=0), A020658 (>0);
no 8-term AP: A020659 (>=0), A020660 (>0);
no 9-term AP: A020661 (>=0), A020662 (>0);
no 10-term AP: A020663 (>=0), A020664 (>0).
Cf. A240075 and A240555 for sequences avoiding 4-term subsequences with constant second differences.
Cf. A240556 and A240557 for sequences avoiding 5-term subsequences with constant third differences.

Programs

  • PARI
    A267300(n, show=0, L=5, o=2, v=[0], D=v->v[2..-1]-v[1..-2])={ my(d, m); while( #v1, ); #Set(d)>1||next(2), 2); break)); v[#v]} \\ M. F. Hasler, Jan 12 2016