A349983 a(n) is the largest k such A000792(k) <= n.

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, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11

Offset: 1

Author

Harry Altman, Jan 08 2022

Keywords

• easy
• nonn

References

• Harry Altman, Integer Complexity: The Integer Defect, Moscow Journal of Combinatorics and Number Theory 8-3 (2019), 193-217.

Links

• Harry Altman, Integer Complexity: The Integer Defect, arXiv:1804.07446 [math.NT], 2018.

Crossrefs

Cf. A005245, A000792, A007600.

Formula

a(n) = max{ 3*floor(log_3(n)), 3*floor(log_3(n/2))+2, 3*floor(log_3(n/4))+4, 1 }.

a(n) = A007600(n)-1 except when n appears in A000792, in which case a(n) = A007600(n).