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.

A210509 x(n+1) = x(n)*Pi/3 with x(0) = Pi, and a(n) = floor(x(n)).

Original entry on oeis.org

3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 12, 13, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 30, 31, 33, 34, 36, 37, 39, 41, 43, 45, 47, 49, 52, 54, 57, 60, 62, 65, 69, 72, 75, 79, 83, 86
Offset: 0

Views

Author

Jon Perry, Jan 25 2013

Keywords

Comments

24 is the first number greater than 3 not in the sequence.
Later output is more separated, for example: 40888572599, 42818413097, 44839337342, 46955644261.

Crossrefs

Cf. A000796 (Pi), A019670 (Pi/3).

Programs

  • JavaScript
    pi=Math.PI;
    x=pi;
    for (i=0;i<600;i++) {x*=pi;x/=3;document.write(Math.floor(x)+", ");}

Formula

x(n+1) = x(n)*Pi/3 with x(0) = Pi, and a(n) = floor(x(n)).