|
%I #11 Feb 16 2013 03:01:49
%S 5,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T 27,28,29,30,31,32,33,34,43,64,1
%N The odd-greedy Egyptian-fraction algorithm for 5/1444613 has 37 terms, the last of which has 384122451172 digits; sequence gives remainder-numerators.
%H Problem of the week, <a href="http://mathforum.org/wagon">Web site</a> - problem 848
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%K nonn,fini,full
%O 0,1
%A _David Broadhurst_
|
