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 A035487 #21 Dec 20 2023 08:04:59
%S A035487 2,6,11,15,19,23,28,32,36,40,44,49,53,57,61,66,70,74,78,83,87,91,95,
%T A035487 100,104,108,112,116,121,125,129,133,138,142,146,150,155,159,163,167,
%U A035487 172,176,180,184,189,193,197,201
%N A035487 Second column of Stolarsky array.
%H A035487 Benoit Cloitre and Jeffrey Shallit, <a href="https://arxiv.org/abs/2312.11706">Some Fibonacci-Related Sequences</a>, arXiv:2312.11706 [math.CO], 2023.
%H A035487 N. J. A. Sloane, <a href="/classic.html#WYTH">Classic Sequences</a>
%F A035487 a(n) = A007067(A007064(n)).
%e A035487 For n=4, A007064(4)=12 and A007067(12)=19, so a(4)=19.
%t A035487 Table[Floor[(# + 1/2) (Sqrt@ 5 + 3)] &[n - 1] - n + 1, {n, 48}] (* _Michael De Vlieger_, Aug 28 2016, after _T. D. Noe_ at A001966 *)
%Y A035487 See A007064 for references.
%Y A035487 Cf. A007064, A035489.
%Y A035487 Equals A001966(n-1) - n + 1.
%K A035487 nonn,easy
%O A035487 1,1
%A A035487 _N. J. A. Sloane_