|
%I #18 Aug 03 2014 14:01:29
%S 0,1,1,0,2,1,1,1,0,0,2,0,2,2,1,1,3,0,0,0,1,0,2,0,0,0,2,1,0,2,2,2,2,1,
%T 2,2,1,2,0,2,0,1,2,1,2,0,2,0,0,0,0,0,1,2,2,2,2,1,2,1,0,1,2,0,0,0,0,2,
%U 2,1,1,0,0,2,2,1,0,0,2,0,0,1,0,1,0,2,2,1,0,0,1,1,0,2,2,0,2,2,0,2,0,2,1,1,0,1,2,1,2,2,2,1,2,2,2,1,0,0,0,1
%N Expansion of the fractional part of Pi in base Pi.
%C The program (see link below) used to calculate this should guarantee enough accuracy. It is not a fast algorithm though, but it served its purpose!
%H Nicholas C. Firth, <a href="/A188921/b188921.txt">Table of n, a(n) for n = 0..9999</a>
%H Nicholas C. Firth, <a href="/A188921/a188921_2.txt">C++ code to generate terms</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Non-integer_representation">Non-integer representation</a>
%e 0.01102111002022113000102000210222212212...
%t RealDigits[Pi - 3, Pi, 100, -1][[1]] (* _T. D. Noe_, Apr 14 2011 *)
%K nonn,base,cons
%O 0,5
%A _Nicholas C. Firth_, Apr 13 2011
|
