%I #22 Nov 17 2023 21:33:08
%S 2,3,4,5,6,7,8,9,102,103,104,105,106,107,108,109,1102,1103,1104,1105,
%T 1106,1107,1108,1109,11102,11103,11104,11105,11106,11107,11108,11109,
%U 111102,111103,111104,111105,111106,111107,111108,111109,1111102,1111103,1111104,1111105,1111106,1111107,1111108,1111109
%N a(n) = n+1 for n = 1 to 8; a(n) = 100 + a(n-8) for n = 9 to 16; thereafter a(8*i+j) = 10^(i+1) + a(8*(i-1)+j) for i >= 2, 1 <= j <= 8.
%C Conjectured to equal A367341(n)/9.
%H Paolo Xausa, <a href="/A367342/b367342.txt">Table of n, a(n) for n = 1..5000</a>
%H <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,-10).
%F a(n) = ((10^i-1)/9)*100 + j, where i = floor((n-1)/8) and j = (n-1) mod 8 + 2.
%t A367342[n_]:=100(10^Floor[(n-1)/8]-1)/9+Mod[n-1,8]+2;Array[A367342,100] (* _Paolo Xausa_, Nov 17 2023 *)
%Y Cf. A367341.
%K nonn,easy
%O 1,1
%A _Michael S. Branicky_ and _N. J. A. Sloane_, Nov 15 2023
|