A232242 - OEIS

A232242

A walk based on the digits of E = exp(1) (A001113).

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, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 3, 4, 5, 4

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

E = 2.718281828459045...

Between 2 and 7 we place 3, 4, 5 and 6.

Between 7 and 1 we place 6, 5, 4, 3 and 2.

Between 1 and 8 we place 2, 3, 4, 5, 6 and 7.

Between 8 and 2 we place 7, 6, 5, 4 and 3, and so on.

This gives:

2, 3, 4, 5, 6, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, ...

This could be called a walk (or promenade) on the digits of E.

LINKS

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

MATHEMATICA

wbe[{a_, b_}]:=Rest[If[b>a, Range[a, b], Range[a, b, -1]]]; Join[{2}, Flatten[ wbe/@ Partition[RealDigits[E, 10, 20][[1]], 2, 1]]] (* Harvey P. Dale, Feb 19 2014 *)

CROSSREFS

Cf. A001113

Sequence in context: A279313 A063265 A211011 * A287655 A073794 A017892

Adjacent sequences: A232239 A232240 A232241 * A232243 A232244 A232245

KEYWORD

nonn,easy,base

AUTHOR

Philippe Deléham, Nov 20 2013 at the suggestion of N. J. A. Sloane

STATUS

approved