Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Apr 11 2021 16:13:25
%S 3,5,6,6,10,12,13,14,15,18,20,24,27,31,34,35,36,38,40,42,43,45,46,47,
%T 48,52,54,56,57,59,63,63,63,67,70,73,75,76,80,81,82,85,88,90,97,100,
%U 101,102,105,105,106,109,110,112,114,119,121,123,126,128,130,132,135
%N Least position m > n in the decimal expansion of Pi=3.1415... such that the sum of all digits at positions < n is not greater than the sum of all digits at positions > n and <= m.
%C For n > 1: A046974(n-1) <= A046974(a(n)) - A046974(n) and A046974(n-1) > A046974(a(n)-1) - A046974(n).
%e n=6: 3+1+4+1+5 <= 2+6+5+3 and 3+1+4+1+5 > 2+6+5; '31415[9]26535897...'.
%Y Cf. A000796.
%K nonn,base
%O 2,1
%A _Reinhard Zumkeller_, Nov 17 2002