A162671 - OEIS

%I #19 Jan 20 2025 22:50:41

%S 0,1,1,101,102,10301,10403,1050601,1061004,107151001,108212005,

%T 10928351501,11036563506,1114584702101,1125621265607,113676711262801,

%U 114802332528408,11593909964103601,11708712296632009,1182465139627304501,1194173851923936510,120599850332020955501

%N For n even a(n) = a(n-1) + a(n-2), for n odd a(n) = 100*a(n-1) + a(n-2), with a(0) = 0, a(1) = 1.

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,102,0,-1).

%F a(n) = 102*a(n-2)-a(n-4). G.f.: x*(1+x-x^2)/((x^2+10*x-1)*(x^2-10*x-1)). - _R. J. Mathar_, Jul 14 2009

%p a:= proc(n) a(n):= `if`(n<2, n, a(n-1)*(1+99*(n mod 2))+a(n-2)) end:

%p seq(a(n), n=0..22);  # _Alois P. Heinz_, Jan 20 2025

%t LinearRecurrence[{0,102,0,-1},{1,1,101,102},20] (* _Harvey P. Dale_, May 08 2020 *)

%Y Partly same as A041059 (and its palindromic partner-sequence A015446). A007318.

%K nonn,easy

%O 0,4

%A _Mark Dols_, Jul 10 2009

%E More terms from _R. J. Mathar_, Jul 14 2009