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 A296892 #7 Jan 21 2023 18:12:02 %S A296892 170,171,172,173,174,175,176,177,178,179,180,181,339,340,341,342,343, %T A296892 344,345,346,347,348,349,350,353,354,355,356,357,358,359,360,361,362, %U A296892 363,508,509,510,511,512,513,514,515,516,517,518,519,522,523,524,525,526 %N A296892 Numbers whose base-13 digits d(m), d(m-1), ..., d(0) have #(pits) > #(peaks); see Comments. %C A296892 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 A296891-A296894 partition the natural numbers. See the guides at A296712 and A296882. %H A296892 Clark Kimberling, <a href="/A296892/b296892.txt">Table of n, a(n) for n = 1..10000</a> %e A296892 The base-13 digits of 59672 are 2,1,2,1,2; here #(pits) = 2 and #(peaks) = 1, so 59672 is in the sequence. %t A296892 z = 200; b = 13; %t A296892 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296892 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296891 *) %t A296892 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296892 *) %t A296892 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296893 *) %Y A296892 Cf. A296882, A296712, A296891, A296893. %K A296892 nonn,base,easy %O A296892 1,1 %A A296892 _Clark Kimberling_, Jan 12 2018