A191014 a(n) = 10*a(n-1) + 2*a(n-2), with a(0)=0, a(1)=1.

0, 1, 10, 102, 1040, 10604, 108120, 1102408, 11240320, 114608016, 1168560800, 11914824032, 121485361920, 1238683267264, 12629803396480, 128775400499328, 1313013611786240, 13387686918861056, 136502896412183040, 1391804337959552512, 14191049172419891200

Offset: 0

Author

Vladimir Joseph Stephan Orlovsky, May 24 2011

Keywords

• nonn
• easy
• less

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (10,2).

Programs

Magma

I:=[0, 1]; [n le 2 select I[n] else 10*Self(n-1)+2*Self(n-2): n in [1..50]]; // Vincenzo Librandi, Feb 20 2012

Mathematica

LinearRecurrence[{10,2}, {0,1}, 50]

PARI

Vec(x/(1-10*x-2*x^2)+O(x^99)) \\ Charles R Greathouse IV, Feb 20 2012

Formula

G.f.: -x /(-1 + 10*x + 2*x^2). - R. J. Mathar, Nov 21 2011