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 A075850 #10 Mar 11 2025 08:23:37
%S A075850 2,3,4,3,5,4,2,6,4,5,2,4,7,3,5,6,2,4,2,5,8,3,2,6,5,7,4,3,2,5,2,6,4,9,
%T A075850 5,4,2,3,7,6,2,8,2,3,5,3,2,6,2,5,4,7,2,4,10,6,4,3,2,5,2,3,8,6,7,4,2,9,
%U A075850 4,5,2,6,2,3,5,3,2,7,2,6,4,3,2,8,5,3,4,6,11,5,7,3,4,3,5,6,2,3,4,5,2,9
%N A075850 Greatest k such that f(k,1) divides f(k,n) where f(k,n) is the k-th term of the sequence: f(1,n)=1, f(2,n)=n, f(k+2,n)=f(k+1,n)+f(k,n).
%C A075850 f(k,1) is the Fibonacci sequence.
%F A075850 It seems that Sum_{i=1..n} a(i) is asymptotic to C*n where 4 < C < 9/2.
%K A075850 nonn
%O A075850 2,1
%A A075850 _Benoit Cloitre_, Oct 15 2002
%E A075850 a(1) removed and a(103) corrected by _Sean A. Irvine_, Mar 11 2025