login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110400 a(1) = 1, a(2) = 21; for n>2, a(n) is the least number whose neighboring digit difference forms a(n-1) such that a(n+1) also exists. 0
1, 21, 132, 1031, 10032, 100031, 1000032, 10000031, 100000032, 1000000031, 10000000032, 100000000031, 1000000000032, 10000000000031, 100000000000032, 1000000000000031, 10000000000000032, 100000000000000031 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(2) = 21 (chosen) and not 10 so that the sequence extends nontrivially.
A040115(a(n+1)) = a(n). - David Wasserman, Oct 02 2005
LINKS
EXAMPLE
After 8421 two possible candidates are 91532 and 91576 but there is no number with digit difference 91576 hence the next term is 91532.
1031 is followed by 10032 because the absolute differences between the numbers 1, 0, 0, 3, 2 are 1, 0, 3, 1.
CROSSREFS
Cf. A011557.
Sequence in context: A228283 A157624 A008384 * A308348 A089369 A328861
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Jul 29 2005
EXTENSIONS
Corrected and extended by David Wasserman, Oct 02 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 12 17:07 EDT 2024. Contains 374251 sequences. (Running on oeis4.)