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.

A293728 Numbers k such that c(k,0) > c(k,1), where c(k,d) = number of d's in the first k digits of base-2 expansion of sqrt(2).

This page as a plain text file.
%I A293728 #8 Apr 21 2021 03:50:34
%S A293728 11,12,13,14,15,16,17,18,19,21,22,23,25,26,27,29,30,31,335,609,610,
%T A293728 611,612,613,614,615,616,617,618,619,620,621,623,624,625,626,627,628,
%U A293728 629,630,631,632,633,634,635,675,677,683,684,685,686,687,688,689,690
%N A293728 Numbers k such that c(k,0) > c(k,1), where c(k,d) = number of d's in the first k digits of base-2 expansion of sqrt(2).
%C A293728 This sequence together with A293725 and A293727 partition the nonnegative integers.
%H A293728 Clark Kimberling, <a href="/A293728/b293728.txt">Table of n, a(n) for n = 1..10000</a>
%t A293728 z = 300; u = N[Sqrt[2], z]; d = RealDigits[u, 2][[1]];
%t A293728 t[n_] := Take[d, n]; c[0, n_] := Count[t[n], 0]; c[1, n_] := Count[t[n], 1];
%t A293728 Table[{n, c[0, n], c[1, n]}, {n, 1, 100}]
%t A293728 u = Select[Range[z], c[0, #] == c[1, #] &]  (* A293725 *)
%t A293728 u/2  (* A293726 *)
%t A293728 Select[Range[z], c[0, #] < c[1, #] &]  (* A293727 *)
%t A293728 Select[Range[z], c[0, #] > c[1, #] &]  (* A293728 *)
%Y A293728 Cf. A004539, A002103, A293726, A293727, A293728.
%K A293728 nonn,easy,base
%O A293728 1,1
%A A293728 _Clark Kimberling_, Oct 18 2017