cp's OEIS Frontend

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.

A296747 Numbers whose base-12 digits d(m), d(m-1), ..., d(0) have #(rises) = #(falls); see Comments.

This page as a plain text file.
%I A296747 #7 Jan 27 2023 19:25:09
%S A296747 1,2,3,4,5,6,7,8,9,10,11,13,26,39,52,65,78,91,104,117,130,143,145,146,
%T A296747 147,148,149,150,151,152,153,154,155,157,168,169,180,181,182,192,193,
%U A296747 194,195,204,205,206,207,208,216,217,218,219,220,221,228,229,230
%N A296747 Numbers whose base-12 digits d(m), d(m-1), ..., d(0) have #(rises) = #(falls); see Comments.
%C A296747 A rise is an index i such that d(i) < d(i+1); a fall is an index i such that d(i) > d(i+1). The sequences A296747-A296749 partition the natural numbers. See the guide at A296712.
%H A296747 Clark Kimberling, <a href="/A296747/b296747.txt">Table of n, a(n) for n = 1..10000</a>
%e A296747 The base-12 digits of 230 are 1,7,2; here #(rises) = 1 and #(falls) = 1, so 230 is in the sequence.
%t A296747 z = 200; b = 12; d[n_] := Sign[Differences[IntegerDigits[n, b]]];
%t A296747 Select[Range [z], Count[d[#], -1] == Count[d[#], 1] &] (* A296747 *)
%t A296747 Select[Range [z], Count[d[#], -1] < Count[d[#], 1] &]  (* A296748 *)
%t A296747 Select[Range [z], Count[d[#], -1] > Count[d[#], 1] &]  (* A296749 *)
%Y A296747 Cf. A296748, A296749, A296712.
%K A296747 nonn,base,easy
%O A296747 1,2
%A A296747 _Clark Kimberling_, Jan 08 2018