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!)
A239085 The sequence S = a(1), a(2), ... is defined by a(1)=1, if d,e,f are consecutive digits then we do not have d < e > f, and S is always extended with the smallest integer not yet present in S. 0

%I #16 Jun 10 2022 09:01:06

%S 1,2,3,4,5,6,7,8,9,90,11,10,12,20,13,30,14,40,15,50,16,60,17,70,18,80,

%T 19,91,22,21,23,31,24,41,25,51,26,61,27,71,28,81,29,92,33,32,34,42,35,

%U 52,36,62,37,72,38,82,39,93,44,43,45,53,46,63,47,73,48,83,49,94,55,54,56,64,57,74,58,84,59,95,66,65,67,75,68,85,69,96,77,76

%N The sequence S = a(1), a(2), ... is defined by a(1)=1, if d,e,f are consecutive digits then we do not have d < e > f, and S is always extended with the smallest integer not yet present in S.

%C Computed by Lars Blomberg.

%D Eric Angelini, Posting to Sequence Fans Mailing List, Sep 28 2013

%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/LittleEqualGreat.htm">Less than <, Equal to =, Greater than ></a> (see sequence Sc)

%H Eric Angelini, <a href="/A239083/a239083.pdf">Less than <, Equal to =, Greater than ></a> [Cached copy, with permission of the author]

%t a[1]=1;a[n_]:=a[n]=Block[{k=1},While[MemberQ[s=Array[a,n-1],k]||Or@@(#<#2>#3&@@@Partition[Flatten[IntegerDigits/@Join[s[[-2;;]],{k}]],3,1]),k++];k];Array[a,90] (* _Giorgos Kalogeropoulos_, May 14 2022 *)

%Y The sequences in this family are given in A239083-A239086, A239136-A239139, A239087-A239090, A239215-A239218, A239235.

%K nonn,base

%O 1,2

%A _N. J. A. Sloane_, Mar 10 2014

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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)