login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = 4*(10^(2*n+1)-1)/9 + 2*10^n.
1

%I #6 Feb 11 2020 08:09:22

%S 6,464,44644,4446444,444464444,44444644444,4444446444444,

%T 444444464444444,44444444644444444,4444444446444444444,

%U 444444444464444444444,44444444444644444444444,4444444444446444444444444,444444444444464444444444444,44444444444444644444444444444,4444444444444446444444444444444

%N a(n) = 4*(10^(2*n+1)-1)/9 + 2*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) = 4*A138148(n) + 6*10^n = A002278(2n+1) + 2*10^n = 2*A332123(n).

%F G.f.: (6 - 202*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 A332146 := n -> 4*(10^(2*n+1)-1)/9+2*10^n;

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

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

%o (Python) def A332146(n): return 10**(n*2+1)//9*4+2*10**n

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

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

%Y Cf. A332116 .. A332196 (variants with different repeated digit 2, ..., 9).

%Y Cf. A332140 .. A332149 (variants with different middle digit 0, ..., 9).

%K nonn,base,easy

%O 0,1

%A _M. F. Hasler_, Feb 09 2020