login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037903 a(n)=(greatest base 9 digit of n)-(least base 9 digit of n). 0
0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 3, 4, 5, 6, 7, 2, 1, 0, 1, 2, 3, 4, 5, 6, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1, 2, 3, 6, 5, 4, 3, 2, 1, 0, 1, 2, 7, 6, 5, 4, 3, 2, 1, 0, 1, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 1, 2, 3, 4, 5, 6, 7, 8, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,12

MATHEMATICA

bnd[n_]:=Module[{idn9=IntegerDigits[n, 9]}, Max[idn9]-Min[idn9]]; Array[bnd, 100] (* From Harvey P. Dale, Jul 12 2011 *)

CROSSREFS

Sequence in context: A056192 A030107 A037895 * A037841 A165111 A038387

Adjacent sequences:  A037900 A037901 A037902 * A037904 A037905 A037906

KEYWORD

nonn,base

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.