cp's OEIS Frontend

A169933 a(n) = 2+n in the arithmetic defined in A169918.

%I A169933 #18 Feb 03 2023 01:40:38
%S A169933 0,2,4,6,8,0,2,4,6,8,10,12,14,16,18,10,12,14,16,18,20,22,24,26,28,20,
%T A169933 22,24,26,28,30,32,34,36,38,30,32,34,36,38,40,42,44,46,48,40,42,44,46,
%U A169933 48,50,52,54,56,58,50,52,54,56,58,60,62,64,66,68,60,62,64,66,68,70,72,74,76,78
%N A169933 a(n) = 2+n in the arithmetic defined in A169918.
%C A169933 Equivalently, apply to the last (decimal) digit of n the operation d->((d*2) mod 10), i.e., multiply the last digit by 2 and take this modulo 10; keep all other digits the same. - _M. F. Hasler_, Mar 25 2015
%H A169933 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,1,-1).
%F A169933 For n > 9, a(n) = a(n-10) + 10. For n < 10, a(n) = (2*n mod 10). - _M. F. Hasler_, Mar 25 2015
%F A169933 From _Chai Wah Wu_, Feb 02 2023: (Start)
%F A169933 a(n) = a(n-1) + a(n-10) - a(n-11) for n > 10.
%F A169933 G.f.: 2*x*(x^9 + x^8 + x^7 + x^6 + x^5 - 4*x^4 + x^3 + x^2 + x + 1)/(x^11 - x^10 - x + 1). (End)
%o A169933 (PARI) A169933(n)=n-n%10+(n*2)%10 \\ _M. F. Hasler_, Mar 25 2015
%o A169933 (Magma) [n - n mod 10 + 2*n mod 10: n in [0..70]]; // _Vincenzo Librandi_, Mar 26 2015
%Y A169933 Cf. A169931 - A169935.
%K A169933 nonn,base
%O A169933 0,2
%A A169933 _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Jul 20 2010