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 A164046 #13 Mar 06 2025 13:54:50
%S A164046 11,101,1010,10010,100100,1000100,10001000,100001000,1000010000,
%T A164046 10000010000,100000100000,1000000100000,10000001000000,
%U A164046 100000001000000,1000000010000000,10000000010000000,100000000100000000,1000000000100000000,10000000001000000000
%N A164046 A001445 written in base 2.
%C A164046 The digit pattern is: one digit 1, A004526(n) times 0, one digit 1, and A004526(n-1) times 0.
%H A164046 G. C. Greubel, <a href="/A164046/b164046.txt">Table of n, a(n) for n = 1..995</a>
%H A164046 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (10,10,-100).
%F A164046 a(n) = 2^n + 2^A004526(n-1) = A007088(A001445(n)).
%F A164046 From _Chai Wah Wu_, Sep 10 2020: (Start)
%F A164046 a(n) = 10*a(n-1) + 10*a(n-2) - 100*a(n-3) for n > 3.
%F A164046 G.f.: x*(-110*x^2 - 9*x + 11)/((10*x - 1)*(10*x^2 - 1)). (End)
%t A164046 Table[IntegerString[(2^n + 2^(Floor[n/2]))/2, 2], {n, 2, 50}] (* _G. C. Greubel_, Sep 08 2017 *)
%t A164046 LinearRecurrence[{10,10,-100},{11,101,1010},30] (* _Harvey P. Dale_, Mar 06 2025 *)
%K A164046 nonn,base,easy
%O A164046 1,1
%A A164046 _Jaroslav Krizek_, Aug 08 2009
%E A164046 Extended by _R. J. Mathar_, Aug 11 2009