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

Concatenation of n digits 1 and 2*n-1 digits 0.
8

%I #21 Feb 27 2024 03:04:38

%S 10,11000,11100000,11110000000,11111000000000,11111100000000000,

%T 11111110000000000000,11111111000000000000000,

%U 11111111100000000000000000,11111111110000000000000000000,11111111111000000000000000000000,11111111111100000000000000000000000

%N Concatenation of n digits 1 and 2*n-1 digits 0.

%C a(n) has 3*n-1 digits.

%C a(n) is also A147538(n) written in base 2. - _Omar E. Pol_, Nov 08 2008.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1100,-100000).

%F From _Colin Barker_, Sep 16 2013: (Start)

%F a(n) = 1100*a(n-1) - 100000*a(n-2).

%F G.f.: 10*x / ((100*x-1)*(1000*x-1)). (End)

%e n ...... a(n)

%e 1 ....... 10

%e 2 ...... 11000

%e 3 ..... 11100000

%e 4 .... 11110000000

%e 5 ... 11111000000000

%t LinearRecurrence[{1100, -100000}, {10, 11000}, 15] (* _Paolo Xausa_, Feb 06 2024 *)

%o (PARI) Vec(10*x/((100*x-1)*(1000*x-1)) + O(x^100)) \\ _Colin Barker_, Sep 16 2013

%Y Cf. A138118, A138145, A138146, A138147, A138719, A138720, A138721, A138722, A147538.

%K base,easy,nonn

%O 1,1

%A _Omar E. Pol_, Apr 03 2008