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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102694 Take the n-th pair of consecutive digits of the sequence and form their absolute difference; the result is the n-th digit of the sequence; a(n) < a(n+1). 0
1, 2, 3, 5, 6, 9, 16, 17, 90, 98, 170, 181, 901, 1090, 8010, 70001, 80010, 90001, 98000, 98808, 99011, 107001, 111010, 800000, 1000900, 1100010, 9080000, 9909080, 80008090, 90001010, 100070000, 100101011, 101000800, 110000000, 111000009 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Start with a(1) = 1. In general choose a(n) to be the smallest number consistent with a(i) (for i < n) and the other requirements.

EXAMPLE

First pair of digits is [12]; absolute difference = 1; 1 is the first digit of the sequence.

2nd pair of digits is [35]; absolute difference = 2; 2 is the 2nd digit of the sequence.

3rd pair of digits is [69]; absolute difference = 3; 3 is the 3rd digit of the sequence.

4th pair of digits is [16]; absolute difference = 5; 5 is the 4th digit of the sequence.

CROSSREFS

Sequence in context: A073216 A059454 A138538 * A124253 A079371 A131761

Adjacent sequences:  A102691 A102692 A102693 * A102695 A102696 A102697

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Feb 04 2005, in collaboration with Hugo van der Sanden, Jacques Tramu, Frederic Zgud and Marc Seguin.

EXTENSIONS

Minor edits by N. J. A. Sloane (njas(AT)research.att.com), Jan 24 2008

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 16 21:51 EST 2012. Contains 205978 sequences.