|
| |
|
|
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).
|
|
1
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
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
|
|
|
LINKS
|
Table of n, a(n) for n=1..63.
Eric Angelini, Un nombre de ouf!
E. Angelini, Un nombre de ouf! [Cached copy, with permission]
|
|
|
CROSSREFS
|
Sequence in context: A199647 A199149 A198669 * A198708 A198627 A198654
Adjacent sequences: A171056 A171057 A171058 * A171060 A171061 A171062
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
|
AUTHOR
|
N. J. A. Sloane, Sep 04 2010, based on a posting to the Sequence Fans Mailing List by Eric Angelini, Aug 24 2010
|
|
|
EXTENSIONS
|
a(40)-a(63) from Charlie Neder, Jun 24 2018
|
|
|
STATUS
|
approved
|
| |
|
|
