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.

A373307 Binary digits of Pi selected by stepping forward d+1 places at digit d, i.e., by skipping the next d places.

This page as a plain text file.
%I A373307 #19 Jun 28 2024 23:09:14
%S A373307 1,0,0,1,0,1,0,0,0,1,1,1,0,1,0,1,1,1,0,0,1,0,0,1,0,0,0,1,1,0,1,0,0,1,
%T A373307 0,0,0,0,1,0,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1,0,0,1,1,
%U A373307 1,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,1,0,1,0,0,1,0,1,1,0,1,0,0,0
%N A373307 Binary digits of Pi selected by stepping forward d+1 places at digit d, i.e., by skipping the next d places.
%C A373307 Are the digits uniformly distributed?  Are all digit sequences uniformly distributed?
%F A373307 a(n) = the (n+a(1)+a(2)+...+a(n-1))-th digit in the binary expansion of Pi.
%e A373307 The sequence starts with the first digit of the binary expansion of Pi, which is 1. The next term is the digit 1+1 places after this, namely, 0, and so on.
%e A373307 The digits selected from Pi begin
%e A373307   Pi=1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, ...
%e A373307      ^     ^  ^  ^     ^  ^     ^  ^  ^  ^     ^
%t A373307 a={1}; s=1; For[n=2, n<=100, n++, s+=Part[a,n-1]+1; digits=First[RealDigits[Pi,2,s]]; AppendTo[a,Part[digits,s]]]; a
%Y A373307 Cf. A004601.
%Y A373307 Cf. A373079, A373304.
%K A373307 nonn,base
%O A373307 1,1
%A A373307 _Karl Levy_, May 31 2024