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 #13 May 14 2024 00:44:43
%S 5,2,19,45,71,153,199,589,301,989,526,1711,739,1633,631,3886,1324,
%T 4897,2524,7021,2374,4189,2311,10033,3571,3901,2326,8869,4789,10873,
%U 6301,10921,6451,11929,6841,12709,7996,13561,7351,19177,9949,16969,12286,22969,11341
%N The least nonsquare number s having exactly n twos in the periodic part of the continued fraction of sqrt(s).
%p V:= Array(0..50): count:= 0:
%p with(NumberTheory):
%p for i from 2 while count < 51 do
%p if issqr(i) then next fi;
%p cf:= Term(ContinuedFraction(sqrt(i)),periodic);
%p v:= numboccur(cf[2],2);
%p if v <= 50 and V[v] = 0 then
%p V[v]:= i; count:= count+1;
%p fi;
%p od:
%p convert(V,list); # _Robert Israel_, May 13 2024
%t nn = 50; zeros = nn; t = Table[0, {nn}]; k = 2; While[zeros > 0, If[! IntegerQ[Sqrt[k]], cnt = Count[ContinuedFraction[Sqrt[k]][[2]], 2]; If[cnt <= nn && t[[cnt]] == 0, t[[cnt]] = k; zeros--]]; k++]; Join[{5}, t]
%Y Cf. A206578 (n ones), A206583 (n threes), A206584 (n fours), A206585 (n fives).
%K nonn
%O 0,1
%A _T. D. Noe_, Mar 19 2012
%E Corrected by _Robert Israel_, May 13 2024