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 A108399 #7 Nov 29 2019 04:01:54
%S A108399 5,2,6,61,52,41,28,13,106,87,66,43,18,393,364,333,300,265,228,189,148,
%T A108399 105,60,13,226,175,122,67,10,463,402,339,274,207,138,67,814,739,662,
%U A108399 583,502,419,334,247,158,67,538,443,346,247,146,43,4494,4387,4278,4167,4054
%N A108399 Least positive k such that n^2 + k is a golden semiprime (A108540).
%C A108399 Conjecture: for every n > 1 there exists a number k < n^3 such that n^2 + k is a golden semiprime.
%H A108399 Amiram Eldar, <a href="/A108399/b108399.txt">Table of n, a(n) for n = 1..10000</a>
%e A108399 a(4)=61 because 4^2+61 = 77 = 7*11 and 7*phi-11 = 0.326237... < 1.
%t A108399 goldQ[n_] := Module[{f = FactorInteger[n]}, If[Length[f] != 2, False, If[Max[f[[;;,2]]] != 1, False, Abs[f[[2,1]] - f[[1,1]] * GoldenRatio] < 1]]]; a[n_] := Module[{k = 1}, While[!goldQ[n^2 + k], k++]; k]; Array[a, 57] (* _Amiram Eldar_, Nov 29 2019 *)
%Y A108399 Cf. A108540.
%K A108399 easy,nonn
%O A108399 1,1
%A A108399 _Jason Earls_, Jul 03 2005