cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A085330 Where records occur in A085068.

This page as a plain text file.
%I A085330 #19 Mar 03 2018 21:31:23
%S A085330 0,1,5,161,1772,3097,3473,23084,38752,335165,491729,38248700,49050536,
%T A085330 95305397,1019659805,1549919921,2973640172,4527000701,6300121204,
%U A085330 10663850980,30980417576,40783699961,57033894608,409565230433
%N A085330 Where records occur in A085068.
%H A085330 J. C. Lagarias and N. J. A. Sloane, Approximate squaring (<a href="http://neilsloane.com/doc/apsq.pdf">pdf</a>, <a href="http://neilsloane.com/doc/apsq.ps">ps</a>), Experimental Math., 13 (2004), 113-128.
%t A085330 f[n_] := Block[{c = 1, k = 4 n/3}, While[ ! IntegerQ@k, c++; k = 4 Ceiling@k/3]; c]; t = Table[0, {1000}]; Do[ a = f@n; If[a < 101 && t[[a]] == 0, t[[a]] = n; Print[{a, n}]], {n, 0, 21*10^8}] (* _Robert G. Wilson v_, May 28 2007 *)
%o A085330 (PARI) f(n)=(4/3)*ceil(n); { a(n) = local(c, k); c=1; k=n; while(frac(f(k))!=0, k=f(k); c++); c } { rec=0; for(n=0,5*10^5,if(a(n)>rec,rec=a(n); print1(n":"a(n)","))) }
%Y A085330 Cf. A085068, A085071, A085328.
%K A085330 nonn,more
%O A085330 1,3
%A A085330 _N. J. A. Sloane_, Aug 13 2003
%E A085330 More terms from _Jason Earls_, Aug 14 2003
%E A085330 a(12)-a(16) from _Robert G. Wilson v_, May 28 2007
%E A085330 a(17)-a(24) from _Lars Blomberg_, Mar 03 2018