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 A381110 #9 Feb 16 2025 22:58:19
%S A381110 1,2,2,2,3,3,4,3,5,3,4,4,4,5,3,5,4,4,6,4,5,5,5,6,5,6,7,6,5,6,7,6,7,5,
%T A381110 7,8,6,8,6,7,9,6,9,7,6,10,6,7,8,7,11,7,7,9,7,12,7,8,10,8,8,8,8,11,8,9,
%U A381110 9,9,9,8,9,10,9,10,9,10,11,8,10,10,10,11,8
%N A381110 a(n) is the maximum number of points from the set {(k, f(k)); k = 0..n} belonging to a straight line passing through the point (n, f(n)), where f(n) = A060143(n) = floor(n/phi) and phi is the golden ratio (sqrt(5)+1)/2.
%C A381110 The sequence would remain the same if A060143 in the definition were replaced with A066096, i.e., if points (k, floor(k*phi)) were considered instead of (k, floor(k/phi)).
%H A381110 Pontus von Brömssen, <a href="/A381110/b381110.txt">Table of n, a(n) for n = 0..10000</a>
%Y A381110 Cf. A060143, A066096, A375422, A381111.
%K A381110 nonn,look
%O A381110 0,2
%A A381110 _Pontus von Brömssen_, Feb 14 2025