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.

A248608 Numbers k such that A248607(k+1) = A248607(k) + 1.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 15, 17, 20, 22, 24, 26, 29, 31, 33, 35, 38, 40, 42, 45, 47, 49, 52, 54, 56, 59, 61, 63, 66, 68, 70, 73, 75, 77, 80, 82, 85, 87, 89, 92, 94, 96, 99, 101, 103, 106, 108, 111, 113, 115, 118, 120, 122, 125, 127, 130, 132, 134, 137, 139
Offset: 1

Views

Author

Clark Kimberling, Oct 10 2014

Keywords

Examples

			(A248607(k+1) - A248607(k)) = (1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2,...), so that A248608 = (1, 3, 5, 7, 9, 11, 13, 15, 17, ..) and A248609 = (2, 4, 6, 8, 10, 12, 14, 16, ...).
		

Crossrefs

Programs

  • Mathematica
    z = 300; p[k_] := p[k] = Sum[2^h/((2 h + 1) Binomial[2 h, h]), {h, 0, k}]
    d = N[Table[Pi/2 - p[k], {k, 1, z/5}], 12]
    f[n_] := f[n] = Select[Range[z], Pi/2 - p[#] < 1/3^n &, 1]
    u = Flatten[Table[f[n], {n, 1, z}]]  (* A248607 *)
    d = Differences[u]
    v = Flatten[Position[d, 1]] (* A248608 *)
    w = Flatten[Position[d, 2]] (* A248609 *)