|
| |
|
|
A232191
|
|
A walk based on the digits of Pi (A000796).
|
|
0
|
|
|
|
3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 5, 4, 3, 4, 5, 6, 7, 8, 9, 8, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 5, 6, 5, 4, 3, 2, 3, 4, 5, 6, 5, 4, 3, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Pi = 3.14159265358979323846....
Between 3 and 1 we place 2.
Between 1 and 4 we place 2 and 3.
Between 4 and 1 we place 3 and 2.
Between 1 and 5 we place 2, 3, and 4.
Between 5 and 9 we place 6, 7, and 8.
Between 9 and 2 we place 8, 7, 6, 5, 4 and 3.
Between 2 and 6 we place 3, 4 and 5.
Between 6 and 5 we place nothing.
Between 5 and 3 we place 4, and so on.
This gives:
3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 5, 4, 3, 4, 5, ...
This could be called a walk (or promenade) on the digits of Pi.
|
|
|
LINKS
|
Table of n, a(n) for n=1..87.
|
|
|
CROSSREFS
|
Cf. A000796
Sequence in context: A324782 A256427 A120441 * A183041 A136560 A105847
Adjacent sequences: A232188 A232189 A232190 * A232192 A232193 A232194
|
|
|
KEYWORD
|
nonn,easy,base
|
|
|
AUTHOR
|
Philippe Deléham, Nov 20 2013
|
|
|
STATUS
|
approved
|
| |
|
|
