This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A043885 #22 Sep 04 2023 12:33:51 %S A043885 11,14,27,30,47,59,62,75,78,91,94,111,123,126,139,142,155,158,191,203, %T A043885 206,219,222,239,251,254,267,270,283,286,303,315,318,331,334,347,350, %U A043885 367,379,382,395,398,411,414,447,459,462,475,478,495,507,510,523,526,539,542 %N A043885 Numbers k such that 2 and 3 occur juxtaposed in the base-4 representation of k but not of k+1. %H A043885 David A. Corneth, <a href="/A043885/b043885.txt">Table of n, a(n) for n = 1..10000</a> %e A043885 27 is in the sequence as 27_10 = 123_4 which has 23 juxtaposed in its base-4 representationand 28_10 = 130_4 does not have 23 juxtaposed in its base-4 representation. - _David A. Corneth_, Aug 28 2023 %t A043885 SequencePosition[Table[If[SequenceCount[IntegerDigits[n,4],{2,3}]>0 || SequenceCount[ IntegerDigits[ n,4],{3,2}]>0,1,0],{n,500}],{1,0}][[;;,1]] (* _Harvey P. Dale_, Aug 28 2023 *) %o A043885 (PARI) is(n) = {has23juxtaposed(n) && !has23juxtaposed(n+1)} %o A043885 has23juxtaposed(n) = {my(d = digits(n, 4)); for(i = 1, #d-1, if(d[i] == 2 && d[i+1] == 3, return(1)); if(d[i] == 3 && d[i+1] == 2, return(1))); 0} \\ _David A. Corneth_, Aug 28 2023 %Y A043885 Cf. A007090. %Y A043885 Cf. A043880, A043881, A043882, A043883, A043884. %K A043885 nonn,base %O A043885 1,1 %A A043885 _Clark Kimberling_ %E A043885 More terms from _David A. Corneth_, Aug 28 2023