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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A043096 Numbers in which every pair of adjacent digits are distinct. 56
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Superset of A010784. - R. J. Mathar, Oct 20 2008 Complement of A171901; A196368(a(n)) = 1. - Reinhard Zumkeller, Oct 28 2001 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE 11 is the first number not in the sequence, since it has a pair of identical adjacent digits. MATHEMATICA t={}; Do[If[!MemberQ[Differences[IntegerDigits[n]], 0], AppendTo[t, n]], {n, 0, 69}]; t (* Jayanta Basu, May 04 2013 *) PROG (Haskell) import Data.List (elemIndices) a043096 n = a043096_list !! n a043096_list = elemIndices 1 a196368_list -- Reinhard Zumkeller, Oct 28 2001 (PARI) is(n)=my(v=digits(n)); for(i=2, #v, if(v[i]==v[i-1], return(0))); 1 \\ Charles R Greathouse IV, Sep 17 2012 (Python) def ok(n): s = str(n); return all(s[i] != s[i+1] for i in range(len(s)-1)) print(list(filter(ok, range(70)))) # Michael S. Branicky, Aug 22 2021 CROSSREFS Cf. A010784, A171901, A196368. Sequence in context: A167520 A051882 A136002 * A160542 A059543 A241158 Adjacent sequences:  A043093 A043094 A043095 * A043097 A043098 A043099 KEYWORD nonn,base AUTHOR EXTENSIONS Offset corrected by Reinhard Zumkeller, Oct 28 2011 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.

Last modified May 19 12:20 EDT 2022. Contains 353833 sequences. (Running on oeis4.)