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.

A277827 Digits that appear twice consecutively in the decimal expansion of Pi, in order of appearance.

This page as a plain text file.
%I A277827 #33 Aug 07 2023 13:29:15
%S A277827 3,8,9,4,9,1,6,4,5,2,1,1,1,5,5,4,2,4,8,6,3,4,3,6,6,3,0,6,5,8,8,0,1,3,
%T A277827 8,6,1,3,1,1,1,4,9,8,2,1,3,3,4,6,2,7,6,0,0,7,7,7,4,2,2,9,1,4,7,7,9,1,
%U A277827 9,9,9,9,9,9,4,5,2,3,4,1,8,0,0,8,3,7,6,5,1,8,7,7,2,6,0,6,1,1,8,3
%N A277827 Digits that appear twice consecutively in the decimal expansion of Pi, in order of appearance.
%C A277827 A digit d of Pi is in this sequence iff A000796(i) = A000796(i+1), where i is the index of d in A000796. - _Felix Fröhlich_, Nov 01 2016
%F A277827 a(n) = A000796(A049514(n)).
%e A277827 Pi=3.14159265358979323846264(33)83279502(88)41971693(99)3751058209749(44)592307816406286208(99)8628034825342(11)70679...
%e A277827 Therefore, this sequence starts 3, 8, 9, 4, 9, 1.
%o A277827 (PARI) pidigit(n) = floor(Pi*10^n) - 10*floor(Pi*10^(n-1))
%o A277827 terms(n) = my(k=1, i=0); while(1, if(pidigit(k)==pidigit(k+1), print1(pidigit(k), ", "); i++); if(i==n, break); k++)
%o A277827 /* Print initial 100 terms as follows */
%o A277827 terms(100) \\ _Felix Fröhlich_, Nov 01 2016
%Y A277827 Cf. A000796, A049514.
%K A277827 nonn,base
%O A277827 1,1
%A A277827 _Bobby Jacobs_, Nov 01 2016