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 A350545 #14 Feb 07 2022 22:02:57
%S A350545 3,41,13,58,61,193,157,337,586,821,601,421,1117,1153,1069,1669,2137,
%T A350545 2053,1381,3733,3541,1621,4657,2389,4561,6577,3061,4261,5209,6121,
%U A350545 6781,8317,7621,6661,6301,7561,7549,15817,9241,9349,12853,8269,11701,16729,14449,23017,31573
%N A350545 a(n) is the least k such that the continued fraction for sqrt(k) has period prime(n).
%C A350545 Conjecture: All terms in this sequence (except a(4) = 58 and a(9) = 586) are primes.
%F A350545 a(n) = A013646(prime(n)).
%e A350545 a(5) = 61 because 61 is the least integer k whose period of the continued fraction for sqrt(k) is prime(5)=11, namely {1, 4, 3, 1, 2, 2, 1, 3, 4, 1, 14}.
%t A350545 n=30;prm={};fin={};k=2;While[Length@prm<n||Sort[PrimePi@prm][[;;n]]!=Range@n,If[!IntegerQ@Sqrt@k,l=Length@Last@ContinuedFraction@Sqrt@k,k++];If[PrimeQ@l,If[FreeQ[prm,l],AppendTo[fin,{k,PrimePi@l}];AppendTo[prm,l]]];k++];First/@SortBy[fin,Last][[;;n]]
%Y A350545 Cf. A003285. A subsequence of A013646.
%K A350545 nonn
%O A350545 1,1
%A A350545 _Giorgos Kalogeropoulos_, Jan 04 2022