A070615 Minimal difference between any two digits of n in base 10.

1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0

Offset

10,4

Comments

From 10^10-1 onwards all the terms are 0's.

Links

Table of n, a(n) for n=10..114.

Example

a(2796) = 1 because the second digit of 2796 is 7 and the last digit is 6 and 7-6=1 which is the minimal difference between all the digits of 2796.

Crossrefs

Sequence in context: A307651 A297330 A037904 * A040114 A064834 A040163

Adjacent sequences: A070612 A070613 A070614 * A070616 A070617 A070618

Keyword

base,easy,nonn

Author

Lior Manor, May 15 2002

Status

approved