This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A152756 #25 Oct 05 2024 21:07:50
%S A152756 1,101,10001,1000001,100000001,10000000001,1000000000001,
%T A152756 100000000000001,10000000000000001,1000000000000000001,
%U A152756 100000000000000000001,10000000000000000000001
%N A152756 Bisection of A000533.
%C A152756 a(1)=1, for n>1, a(n) is the concatenation of "1", 2(n-1)-1 digits "0" and "1". - _Omar E. Pol_, Dec 14 2008
%H A152756 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (101,-100).
%F A152756 Except the first term, a(n)=10^(2n-2)+1. - _Robert G. Wilson v_, Dec 14 2008
%F A152756 G.f.: x*(1-100*x^2)/(1-x)/(1-100*x). - _Robert Israel_, Jul 27 2014
%e A152756 n ..... a(n)
%e A152756 1 ....... 1
%e A152756 2 ...... 101
%e A152756 3 ..... 10001
%e A152756 4 .... 1000001
%e A152756 5 ... 100000001
%t A152756 A152756[n_] := If[n == 1, 1, 100^(n-1) + 1]; Array[A152756, 20] (* or *)
%t A152756 LinearRecurrence[{101, -100}, {1, 101, 10001}, 20] (* _Paolo Xausa_, Oct 05 2024 *)
%o A152756 (Magma) [1] cat [10^(2*n)+1: n in [1..15]]; // _Vincenzo Librandi_, Jul 27 2014
%Y A152756 Cf. A000533, A135577, A138120, A138146.
%K A152756 easy,nonn,less
%O A152756 1,2
%A A152756 _Omar E. Pol_, Dec 13 2008