login
a(n) = 5*(10^(2*n+1)-1)/9 + 3*10^n.
1

%I #7 Feb 11 2020 08:17:34

%S 8,585,55855,5558555,555585555,55555855555,5555558555555,

%T 555555585555555,55555555855555555,5555555558555555555,

%U 555555555585555555555,55555555555855555555555,5555555555558555555555555,555555555555585555555555555,55555555555555855555555555555,5555555555555558555555555555555

%N a(n) = 5*(10^(2*n+1)-1)/9 + 3*10^n.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000).

%F a(n) = 5*A138148(n) + 8*10^n = A002279(2n+1) + 3*10^n.

%F G.f.: (8 - 303*x - 200*x^2)/((1 - x)(1 - 10*x)(1 - 100*x)).

%F a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.

%p A332158 := n -> 5*(10^(2*n+1)-1)/9+3*10^n;

%t Array[5 (10^(2 # + 1)-1)/9 + 3*10^# &, 15, 0]

%o (PARI) apply( {A332158(n)=10^(n*2+1)\9*5+3*10^n}, [0..15])

%o (Python) def A332158(n): return 10**(n*2+1)//9*5+3*10**n

%Y Cf. A002275 (repunits R_n = (10^n-1)/9), A002279 (5*R_n), A011557 (10^n).

%Y Cf. A138148 (cyclops numbers with binary digits), A002113 (palindromes).

%Y Cf. A332118 .. A332178, A181965 (variants with different repeated digit 1, ..., 9).

%Y Cf. A332150 .. A332159 (variants with different middle digit 0, ..., 9).

%K nonn,base,easy

%O 0,1

%A _M. F. Hasler_, Feb 09 2020