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.
%I A143577 #28 Mar 31 2020 03:02:39
%S A143577 73,97,233,277,349,353,613,821,877,1073,1181,1189,1277,1285,1313,1385,
%T A143577 1613,1637,1693,1745,1865,2357,2581,2777,3233,3557,3989,4157,4469,
%U A143577 4517,4553,4709,4889,4925,4933,5245,5261,5305,5597,6113,6205,6253,7213,7585,7837,8885
%N A143577 Numbers k such that the continued fraction of (1 + sqrt(k))/2 has period 9.
%C A143577 For primes in this sequence see A146354.
%C A143577 Superset of A146354. - _R. J. Mathar_, Nov 05 2008
%H A143577 Amiram Eldar, <a href="/A143577/b143577.txt">Table of n, a(n) for n = 1..10000</a>
%e A143577 a(1) = 73 because continued fraction of (1+sqrt(73))/2 = 4, 1, 3, 2, 1, 1, 2, 3, 1, 7, 1, 3, 2, 1, 1, 2, 3, 1, 7, 1, 3, 2, 1, 1, 2, 3, 1, 7, 1, 3, ... has period (1, 3, 2, 1, 1, 2, 3, 1, 7) length 9 .
%p A143577 isA143577 := proc(k) local c; try c := numtheory[cfrac](1/2+sqrt(k)/2,'periodic','quotients') ; if nops(c[2]) = 9 then RETURN(true) ; else RETURN(false) ; fi; catch: RETURN(false) ; end try; end: for k from 2 to 80000 do if isA143577(k) then printf("%d, ",k) ; fi; od: # _R. J. Mathar_, Nov 05 2008
%t A143577 Select[Range[1000], !IntegerQ @ Sqrt[#] && Length[ContinuedFraction[(1 + Sqrt[#])/2][[2]]] == 9 &] (* _Amiram Eldar_, Mar 19 2020 *)
%Y A143577 Cf. A000290, A078370, A146326-A146345, A146348-A146360.
%K A143577 nonn
%O A143577 1,1
%A A143577 _Artur Jasinski_, Oct 30 2008
%E A143577 Extended by _R. J. Mathar_, Nov 05 2008
%E A143577 More terms from _Amiram Eldar_, Mar 19 2020