%I #9 Nov 18 2025 12:02:14
%S 1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N Number of digits in base-7 representation of n.
%H Paolo Xausa, <a href="/A390765/b390765.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = floor(log_7(n)) + 1, for n >= 1.
%e a(1000) = 4 because 1000 = 2626_7 (4 digits).
%t A390765[n_] := If[n == 0, 1, IntegerLength[n, 7]];
%t Array[A390765, 100, 0]
%Y Cf. analogous sequences for other bases: A070939 (base 2), A081604 (base 3), A110591 (base 4), A110592 (base 5), A390764 (base 6), A390766 (base 8), A390767 (base 9), A055642 (base 10).
%Y Cf. A007093.
%K nonn,base,easy
%O 0,8
%A _Paolo Xausa_, Nov 18 2025