Erich Friedman, <a href="httphttps://www2erich-friedman.stetsongithub.edu/~efriedmaio/numbers.html">What's Special About This Number?</a> (See entry 73.)
Erich Friedman, <a href="httphttps://www2erich-friedman.stetsongithub.edu/~efriedmaio/numbers.html">What's Special About This Number?</a> (See entry 73.)
proposed
approved
editing
proposed
Rest@ CoefficientList[Series[x (1 + 62 x)/((1 - x) (1 - 10 x)), {x, 0, 20}], x] (* or *)
Table[If[n == 1, 1, FromDigits@ Join[{7}, ConstantArray[9, n - 2], {3}]], {n, 20}] (* or *)
LinearRecurrence[{11, -10}, {1, 73}, 20] (* Michael De Vlieger, Feb 12 2017 *)
proposed
editing
editing
proposed
(PARI) isok(n) = 2*fromdigits(Vecrev(digits(n))) - n == 1; \\ Michel Marcus, Feb 12 2017
proposed
editing
editing
proposed
Matthew House, <a href="/A169830/b169830.txt">Table of n, a(n) for n = 1..996</a>
<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).
From Matthew House, Feb 12 2017: (Start)
G.f.: x*(1+62*x)/((1-x)*(1-10*x)).
a(n) = 11*a(n-1) - 10*a(n-2). (End)
approved
editing
proposed
approved
editing
proposed