

A232360


A walk based on the digits of Champernowne constant C (A033307).


0



0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 1, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

C = 0,12345678910111213141516171819202122...
Between 0 and 1 we place nothing.
Between 1 and 2 we place nothing.
Between 2 and 3 we place nothing.
Between 3 and 4 we place nothing.
Between 4 and 5 we place nothing.
Between 5 and 6 we place nothing.
Between 6 and 7 we place nothing.
Between 7 and 8 we place nothing.
Between 8 and 9 we place nothing.
Between 9 and 1 we place 8, 7, 6, 5, 4, 3 and 2.
....
Between 1 and 3 we place 2.
Between 3 and 1 we place 2, and so on.
This gives:
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, ...
This could be called a walk (or promenade) on the digits of C.


LINKS

Table of n, a(n) for n=1..87.


CROSSREFS

Cf. A007376, A033307
Sequence in context: A245351 A028902 A081598 * A158289 A213652 A262734
Adjacent sequences: A232357 A232358 A232359 * A232361 A232362 A232363


KEYWORD

nonn,easy,base


AUTHOR

Philippe Deléham, Nov 23 2013


STATUS

approved



