id:A070615 - OEIS Search Results

Search: id:A070615

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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 (list; graph; listen)

	OFFSET	`10,4`
	COMMENT	`From 10^10-1 onwards all the terms are 0's.`
	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: A023125 A030108 A037904 this_sequence A040114 A064834 A040163` `Adjacent sequences: A070612 A070613 A070614 this_sequence A070616 A070617 A070618`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Lior Manor (lior.manor(AT)gmail.com) May 15 2002`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research