|
%I #9 Aug 02 2017 05:02:27
%S 110,10100,1001000,100010000,10000100000,1000001000000,
%T 100000010000000,10000000100000000,1000000001000000000,
%U 100000000010000000000,10000000000100000000000,1000000000001000000000000,100000000000010000000000000,10000000000000100000000000000
%N a(n) = 10^(2*n) + 10^n.
%C A161168(n) or A063376(n) for n >= 1 written in base 2.
%C The digits from the left to the right: a 1, (n-1) times 0, a 1, and n times 0.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (110,-1000).
%F a(n) = 110*a(n-1) - 1000*a(n-2).
%F a(n) = 10*A163449(n).
%F G.f.: 10*x*(11 -200*x)/((100*x-1)*(10*x-1)).
%F E.g.f.: exp(100*x) + exp(10*x) -2. - _G. C. Greubel_, Aug 01 2017
%t LinearRecurrence[{110,-1000}, {110,10100}, 50] (* _G. C. Greubel_, Aug 01 2017 *)
%o (PARI) x='x+O('x^50); Vec(10*x*(11 -200*x)/((100*x-1)*(10*x-1))) \\ _G. C. Greubel_, Aug 01 2017
%K nonn,base,easy
%O 1,1
%A _Jaroslav Krizek_, Aug 02 2009
%E Edited by _R. J. Mathar_, Aug 06 2009
| 