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.

A327301 Positions of 2's in {A327298(n) : n > 0}.

Original entry on oeis.org

5, 6, 7, 12, 13, 14, 19, 20, 21, 26, 27, 28, 33, 34, 35, 41, 42, 48, 49, 55, 56, 62, 63, 69, 70, 76, 77, 83, 84, 90, 91, 97, 98, 104, 105, 111, 112, 113, 118, 119, 120, 125, 126, 127, 132, 133, 134, 139, 140, 141, 146, 147, 148, 154, 155, 161, 162, 168, 169, 175
Offset: 1

Views

Author

Clark Kimberling, Sep 06 2019

Keywords

Comments

The positive integers are partitioned by A327299, A327300, and A327301.
Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
Positive integers k such that A327298(k) = 2. - Jianing Song, Sep 30 2019

Crossrefs

Programs

  • Mathematica
    r = Pi; z = 300;
    t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327298(n) : n > 0} *)
    Flatten[Position[t, 0]]  (* A327299 *)
    Flatten[Position[t, 1]]  (* A327300 *)
    Flatten[Position[t, 2]]  (* A327301 *)

Extensions

Corrected by Jianing Song, Sep 30 2019