|
%I #13 Sep 19 2019 22:42:35
%S 1,7,47,35398,283,23598775598298873,2,17699,15732517,
%T 1415926535897932384626433832795,12872,
%U 117993877991494365385536152732919,1089174258383,1,943951,88495408493620774,8328979622929,7866258532766291,7452244925778591498
%N Find the shortest prefix of Pi-3 = .141592653589793238462643383279502.. which is divisible by n and divide by n.
%C a(152) has 1218 digits, so is too large for a b-file. - _Robert Israel_, Sep 19 2019
%H Robert Israel, <a href="/A088143/b088143.txt">Table of n, a(n) for n = 1..151</a>
%e 1/1 = 1, 14/2 = 7, 141/3 = 47, 141592/4 = 35398, 1415/5 = 283,...
%p F:= floor((Pi-3)*10^10000):
%p Prefs:= [seq(floor(F/10^(10000-i)),i=1..10000)]:
%p f:= proc(n) local i;
%p for i from 1 to nops(Prefs) do if Prefs[i] mod n = 0 then return Prefs[i]/n fi od:
%p FAIL
%p end proc:
%p map(f, [$1..151]); # _Robert Israel_, Sep 19 2019
%Y Cf. A000796.
%K base,nonn
%O 1,2
%A _N. J. A. Sloane_, Nov 03 2003
%E Corrected and extended by _Ray Chandler_ and _Vladeta Jovovic_, Nov 06 2003
%E Name corrected by _Robert Israel_, Sep 19 2019
|
