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 A377865 #15 Nov 24 2024 20:04:06
%S A377865 1,3,5,7,3,11,13,5,17,19,7,23,5,9,29,31,11,7,37,13,41,43,9,47,7,17,53,
%T A377865 11,19,59,61,9,13,67,23,71,73,15,11,79,9,83,17,29,89,13,31,19,97,11,
%U A377865 101,103,15,107,109,37,113,23,13,17,11,41,25,127,43,131,19
%N A377865 Smallest divisor of 2n-1 greater than or equal to sqrt(2n-1).
%F A377865 a(n) = A033677(2n-1).
%F A377865 a(n) = A377499(n) + A219695(n).
%t A377865 a[n_]:=Module[{k=1},While[!Divisible[2n-1,k] || k<Sqrt[2n-1] ,k++]; k]; Array[a,67] (* _Stefano Spezia_, Nov 17 2024 *)
%Y A377865 Odd bisection of A033677.
%Y A377865 Cf. A377499, A219695.
%K A377865 nonn,easy
%O A377865 1,2
%A A377865 _Charles Kusniec_, Nov 10 2024