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 A296886 #7 Jan 21 2023 20:28:44 %S A296886 122,123,124,125,126,127,128,129,130,131,243,244,245,246,247,248,249, %T A296886 250,251,252,255,256,257,258,259,260,261,262,263,364,365,366,367,368, %U A296886 369,370,371,372,373,376,377,378,379,380,381,382,383,384,388,389,390,391 %N A296886 Numbers whose base-11 digits d(m), d(m-1), ..., d(0) have #(pits) > #(peaks); see Comments. %C A296886 A pit is an index i such that d(i-1) > d(i) < d(i+1); a peak is an index i such that d(i-1) < d(i) > d(i+1). The sequences A296885-A296887 partition the natural numbers. See the guides at A296712 and A296882. %H A296886 Clark Kimberling, <a href="/A296886/b296886.txt">Table of n, a(n) for n = 1..10000</a> %e A296886 The base-11 digits of 30868 are 2,1,2,1,2; here #(pits) = 2 and #(peaks) = 1, so 30368 is in the sequence. %t A296886 z = 200; b = 11; %t A296886 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296886 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296885 *) %t A296886 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296886 *) %t A296886 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296887 *) %Y A296886 Cf. A296882, A296712, A296885, A296887. %K A296886 nonn,base,easy %O A296886 1,1 %A A296886 _Clark Kimberling_, Jan 10 2018