Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #37 Mar 22 2022 18:44:56
%S 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 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,
%U 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11
%N a(n) is the largest k such A000792(k) <= n.
%D Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217.
%H Harry Altman, <a href="https://arxiv.org/abs/1804.07446">Integer Complexity: The Integer Defect</a>, arXiv:1804.07446 [math.NT], 2018.
%F a(n) = max{ 3*floor(log_3(n)), 3*floor(log_3(n/2))+2, 3*floor(log_3(n/4))+4, 1 }.
%F a(n) = A007600(n)-1 except when n appears in A000792, in which case a(n) = A007600(n).
%Y Cf. A005245, A000792, A007600.
%K easy,nonn
%O 1,2
%A _Harry Altman_, Jan 08 2022