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 A349983 #37 Mar 22 2022 18:44:56
%S A349983 1,2,3,4,4,5,5,5,6,6,6,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,
%T A349983 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,
%U A349983 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11
%N A349983 a(n) is the largest k such A000792(k) <= n.
%D A349983 Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217.
%H A349983 Harry Altman, <a href="https://arxiv.org/abs/1804.07446">Integer Complexity: The Integer Defect</a>, arXiv:1804.07446 [math.NT], 2018.
%F A349983 a(n) = max{ 3*floor(log_3(n)), 3*floor(log_3(n/2))+2, 3*floor(log_3(n/4))+4, 1 }.
%F A349983 a(n) = A007600(n)-1 except when n appears in A000792, in which case a(n) = A007600(n).
%Y A349983 Cf. A005245, A000792, A007600.
%K A349983 easy,nonn
%O A349983 1,2
%A A349983 _Harry Altman_, Jan 08 2022