A109527 Prague bus clock sequence.

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 2, 0, 0, 2, 0, 0, 0, 2, 1, 0, 0, 2, 2, 0, 0, 5, 0, 0, 0, 5, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 5, 0, 0, 1, 5, 1, 0, 2, 0, 0, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 1, 0, 0

Offset

0,12

Comments

See the sequence as a succession of quadruplets showing the time (in hours and minutes). The sequence starts at midnight (00:00) and ends at 22:51 showing all sound times seen in a lateral mirror (if the clock in the bus indicates 22:51 one will read 15:22 in a lateral window, which is a possible time of the day, thus the quadruplet 2251 belongs to the sequence; the quadruplet 0825 is not in the sequence as 08:25 produces 25:80 in the window). On such a digital clock the only digits which produce another "mirror" digit are 0 (->0), 1 (->1), 2 (->5), 5(->2) and 8(->8). "8" must be discarded in this sequence and "5" carefully used.

Links

Table of n, a(n) for n=0..104.

Crossrefs

Cf. A028354, A109571.

Sequence in context: A277885 A333842 A334109 * A362424 A186715 A331983

Adjacent sequences: A109524 A109525 A109526 * A109528 A109529 A109530

Keyword

base,easy,fini,nonn

Author

Eric Angelini and others, Aug 29 2005

Status

approved