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.

A171059 a(n) is the lexically first sequence of distinct nonzero integers such that if S(n) is the string formed from the digits of a(1)a(2)...a(n), then dividing S(n) into substrings with lengths equal to the successive digits of S(n) (treating 0 as 10) results in substrings beginning with the successive digits of Pi (A000796).

Original entry on oeis.org

3, 1, 2, 14, 4, 15, 5, 6, 7, 9, 8, 10, 26, 11, 12, 50, 13, 23, 16, 17, 25, 18, 19, 20, 80, 21, 22, 24, 29, 27, 28, 30, 37, 90, 31, 32, 33, 34, 35, 200, 36, 43, 84, 60, 201, 38, 61, 39, 40, 41, 42, 430, 53, 48, 44, 320, 45, 46, 79, 47, 49, 51, 52
Offset: 1

Views

Author

N. J. A. Sloane, Sep 04 2010, based on a posting to the Sequence Fans Mailing List by Eric Angelini, Aug 24 2010

Keywords

Comments

Erase the punctuation:
S(Pi) = 312144155679810261112501323161725181920802122242927283037903132333435...
Divide into chunks -- the size of each chunk is given by the successive DIGITS of S(Pi):
312.1.44.1.5567.9810.2.61112.50132.316172.5181920.802122242.92728303.7.9031323334.35
(the "0" digits produce a 10-digit chunk)
Replace all dots (.) with carriage returns:
312
1
44
1
5567
9810
2
61112
50132
316172
5181920
802122242
92728303
7
9031323334
35
...
The first column shows Pi!
a(63) = 52 is the last term, a(64) would have to begin with a 0. - Charlie Neder, Jun 24 2018

Extensions

a(40)-a(63) from Charlie Neder, Jun 24 2018