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 A383194 #10 Apr 29 2025 13:20:06 %S A383194 1,1,2,2,3,4,4,4,4,4,5,5,6,6,6,6,7,7,7,8,8,8,9,10,10,10,10,10,11,11 %N A383194 The least number of times that b(k) = 2*k - 1 for the first n terms of a "mean-central" sequence, as is defined in A383192. %C A383194 Problem 2 of the 2025 European Girls' Mathematical Olympiad implies that a(n) -> oo as n -> oo. %H A383194 Art of Problem Solving, <a href="https://artofproblemsolving.com/community/c6h3549401p34560823">European Girls' Mathematical Olympiad 2025 Problem 2</a> %H A383194 Yifan Xie, <a href="/A383194/a383194.txt">Python program</a> %Y A383194 Cf. A383192, A383193. %K A383194 nonn,more %O A383194 1,3 %A A383194 _Yifan Xie_, Apr 21 2025