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 A020961 #13 Jul 06 2019 11:32:18
%S A020961 4,11,16,23,31,36,44,49,57,64,69,77,85,91,98,103,111,119,124,131,137,
%T A020961 145,153,158,165,173,178,186,191,200,207,212,219,228,234,242,247,254,
%U A020961 262,267,274,280,288,295,301,308,317,323,330,335,343,350
%N A020961 a(n) = Sum_{k >= 1} floor(n*phi^(3-k)).
%H A020961 C. Kimberling, <a href="https://www.jstor.org/stable/2975195">Problem 10520</a>, Amer. Math. Mon. 103 (1996) p. 347.
%Y A020961 Cf. A001622 (phi), A020960.
%K A020961 nonn
%O A020961 1,1
%A A020961 _Clark Kimberling_
%E A020961 Title improved and more terms from _Sean A. Irvine_, May 05 2019