Phil, can't you just modify the Mma code, e.g. In[321]:= $MaxExtraPrecision=999999999;Reap[For[{lo={0,1},hi={1,0},nu={0,0},n=0},n<20,nu=lo+hi;For[{k=nu[[2]]},Floor[k*2/Log[2]]!=Ceiling[2/(2^(1/k)-1)],k+=nu[[2]],Sow[Short[{++n,k}]]]; If[nu[[1]]*Log[2]>2*nu[[2]],hi=nu,lo=nu]]][[2,1]] Out[321]= {{1,777451915729368},{2,140894092055857794},{3,1526223088619171207},{4,3052446177238342414},{5,54545811706258836911039145},{6,624965662836733496131286135873807507},{7,1667672249427111806462471627630318921648499},{8,36465374036664559522628534720215805439659141},{9,72930748073329119045257069440431610879318282},{10,2424113537313479652351566323080535902276508627},{11,123447463532804139472316739803506251988903644272},{12,246894927065608278944633479607012503977807288544},{13,370342390598412418416950219410518755966710932816},{14,97841697218028095572510076719589816668243339678931971},{15,5630139432241886550932967438485653485900841911029964871},{16,67828503903932028724406381<<5>>41860326049085269592368999},{17,13565700780786405744881276<<6>>83720652098170539184737998},{18,31224882396890130461213552<<32>>82642817828920779530446911},{19,51263782972844760095024321<<33>>77185206388903158084832387},{20,18682663844967088406936829<<36>>55972395912786276854715767}} Or are you angling for an outside opinion (which would indeed be welcome)? --rwg From: Neil Sloane <njasloane@gmail.com> I've added Bill Gosper's Mma code to A129935. Phil, does your Pari code need any changes? If so, could you make them please? PhilC>I can do a very quick change (basically bump the loop limit to c[n+1]) right now, and that that's good for 100 terms, but I'd like to test it *much* more thoroughly first. My code explodes with new terms in vast quantities as soon as it reaches 500 digits, and I'd like to investigate that to check it's not a bug. Can someone send me (offlist, obviously) the Mma output up to *big*, (say, the 5000 terms, and maybe some additional larger terms with indices for spot-checking?) please? Phil