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 A296896 #7 Jan 21 2023 18:06:09 %S A296896 224,225,238,239,240,252,253,254,255,266,267,268,269,270,280,281,282, %T A296896 283,284,285,294,295,296,297,298,299,300,308,309,310,311,312,313,314, %U A296896 315,322,323,324,325,326,327,328,329,330,336,337,338,339,340,341,342,343 %N A296896 Numbers whose base-14 digits d(m), d(m-1), ..., d(0) have #(pits) < #(peaks); see Comments. %C A296896 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 A296894-A296896 partition the natural numbers. See the guides at A296712 and A296882. %H A296896 Clark Kimberling, <a href="/A296896/b296896.txt">Table of n, a(n) for n = 1..10000</a> %e A296896 The base-14 digits of 44129 are 1,2,1,2,1; here #(pits) = 1 and #(peaks) = 2, so 44129 is in the sequence. %t A296896 z = 200; b = 14; %t A296896 d[n_] := Differences[Sign[Differences[IntegerDigits[n, b]]]]; %t A296896 Select[Range [z], Count[d[#], -2] == Count[d[#], 2] &] (* A296894 *) %t A296896 Select[Range [z], Count[d[#], -2] < Count[d[#], 2] &] (* A296895 *) %t A296896 Select[Range [z], Count[d[#], -2] > Count[d[#], 2] &] (* A296896 *) %Y A296896 Cf. A296882, A296712, A296894, A296895. %K A296896 nonn,base,easy %O A296896 1,1 %A A296896 _Clark Kimberling_, Jan 12 2018