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 A296871 #12 Jan 23 2023 02:48:11 %S A296871 37,38,39,40,41,73,74,75,76,77,80,81,82,83,109,110,111,112,113,116, %T A296871 117,118,119,123,124,125,145,146,147,148,149,152,153,154,155,159,160, %U A296871 161,166,167,181,182,183,184,185,188,189,190,191,195,196,197,202,203 %N A296871 Numbers whose base-6 digits d(m), d(m-1), ..., d(0) have #(pits) > #(peaks); see Comments. %C A296871 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 A296870-A296872 partition the natural numbers. See the guides at A296882 and A296712. %H A296871 Clark Kimberling, <a href="/A296871/b296871.txt">Table of n, a(n) for n = 1..10000</a> %e A296871 The base-6 digits of 203 are 5,3,5; here #(pits) = 1 and #(peaks) = 0, so 203 is in the sequence. %t A296871 z = 200; b = 6; %t A296871 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296871 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296870 *) %t A296871 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296871 *) %t A296871 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296872 *) %Y A296871 Cf. A296882, A296712, A296870, A296872. %K A296871 nonn,base,easy %O A296871 1,1 %A A296871 _Clark Kimberling_, Jan 09 2018