Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Jul 03 2022 20:11:41
%S 1,2,3,4,5,6,7,8,9,10,12,11,13,14,15,16,17,18,19,20,21,23,22,24,25,26,
%T 27,28,29,30,31,32,34,33,35,36,37,38,39,40,41,42,43,45,44,46,47,48,49,
%U 50,51,52,53,54,56,55,57,58,59,60,61,62,63,64,65,67,66,68
%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 Se)
%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,68] (* _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