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,2

References

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

Links

Table of n, a(n) for n=1..72.

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

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).

Crossrefs

Cf. A005245, A000792, A007600.

Sequence in context: A049839 A130233 A131234 * A204924 A172006 A172005

Adjacent sequences: A349980 A349981 A349982 * A349984 A349985 A349986

Keyword

easy,nonn

Author

Harry Altman, Jan 08 2022

Status

approved