|
%I #19 Mar 11 2024 06:02:58
%S 1,11,1011,101011,10101011,1010101011,101010101011,10101010101011,
%T 1010101010101011,101010101010101011,10101010101010101011,
%U 1010101010101010101011,101010101010101010101011,10101010101010101010101011,1010101010101010101010101011
%N a(n) = A007583(n) written in binary.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (101,-100).
%F a(n) = (89+10^(1+2*n))/99. a(n) = 101*a(n-1)-100*a(n-2). G.f.: -(90*x-1) / ((x-1)*(100*x-1)). - _Colin Barker_, Sep 02 2013
%e A007583(2) = 11, which becomes 1011 when written in binary.
%t Table[FromDigits[IntegerDigits[(2^(2n + 1) + 1)/3, 2]], {n, 0, 14}]
%Y Cf. A007583.
%K easy,nonn,less,base
%O 0,2
%A _Artur Jasinski_, Feb 09 2007
%E Edited and extended by _Stefan Steinerberger_, Jun 11 2007
%E More terms from _Colin Barker_, Sep 02 2013
|
