|
%I #20 Dec 19 2022 05:34:42
%S 14,194,1994,19994,199994,1999994,19999994,199999994,1999999994,
%T 19999999994,199999999994,1999999999994,19999999999994,
%U 199999999999994,1999999999999994,19999999999999994,199999999999999994,1999999999999999994,19999999999999999994,199999999999999999994
%N Numbers k such that reverse(k+6) = 2.
%C reverse(a(n)) = A086949(n).
%H Vincenzo Librandi, <a href="/A086946/b086946.txt">Table of n, a(n) for n = 1..300</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).
%F a(n) = 2*(10^n-3).
%F From _Stefano Spezia_, Dec 15 2022: (Start)
%F O.g.f.: 2*x*(7 + 20*x)/((1 - x)*(1 - 10*x)).
%F E.g.f.: 2*(2 - 3*exp(x) + exp(10*x)).
%F a(n) = 11*a(n-1) - 10*a(n-2) for n > 2. (End)
%o (Magma) [2*(10^n-3): n in [1..25] ]; // _Vincenzo Librandi_, Aug 22 2011
%Y Cf. A004086, A086949.
%K nonn,base,easy
%O 1,1
%A _Ray Chandler_, Jul 24 2003
|
