|
%I #15 Dec 24 2016 10:57:45
%S 1,11,1010,100100,10001000,1000010000,100000100000,10000001000000,
%T 1000000010000000,100000000100000000,10000000001000000000,
%U 1000000000010000000000,100000000000100000000000,10000000000001000000000000,1000000000000010000000000000
%N A007582 written in base 2.
%C For n >= 1, the digits are a "1", (n-1) times "0", a "1", and (n-1) times "0".
%H G. C. Greubel, <a href="/A163449/b163449.txt">Table of n, a(n) for n = 0..250</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (110, -1000).
%F a(n) = 10^(2n-1) + 10^(n-1) = A163664(n)/10 for n >= 1.
%F a(n) = A007088(A007582(n)). - _Michel Marcus_, Dec 24 2016
%t Join[{1}, Table[10^(2n-1) + 10^(n-1), {n,1,25}]] (* or *) Join[{1}, LinearRecurrence[{110, -1000}, {11, 1010}, 25]] (* _G. C. Greubel_, Dec 24 2016 *)
%o (PARI) concat([1], for(n=1,50, print1(10^(2*n-1) + 10^(n-1), ", "))) \\ _G. C. Greubel_, Dec 24 2016
%Y Cf. A007088, A007582.
%K nonn,base,easy
%O 0,2
%A _Jaroslav Krizek_, Jul 27 2009
%E Edited by _R. J. Mathar_, Aug 06 2009
|
