login
a(n) = A146081(n) mod 9.
1

%I #27 Dec 12 2023 08:23:10

%S 2,4,6,8,1,3,5,7,0,2,4,6,8,1,3,5,7,0,2,4,6,8,1,3,5,7,0,2,4,6,8,1,3,5,

%T 7,0,2,4,6,8,1,3,5,7,0,2,4,6,8,1,3,5,7,0,2,4,6,8,1,3,5,7,0,2,4,6,8,1,

%U 3,5,7,0,2,4,6,8,1,3,5,7,0

%N a(n) = A146081(n) mod 9.

%C A periodic double sawtooth pattern of positive even and odd numbers.

%H G. C. Greubel, <a href="/A146082/b146082.txt">Table of n, a(n) for n = 0..10000</a>

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

%F a(n) = A131669(n+2)-1.

%F Period 9: a(n+9)=a(n).

%F a(n) = (74*n + 110) mod 9. - _G. C. Greubel_, Jan 29 2016

%t a := LinearRecurrence[{2, -1}, {110, 184}, 100];

%t Mod[a, 9] (* _G. C. Greubel_, Jan 29 2016 *)

%t PadRight[{},120,{2,4,6,8,1,3,5,7,0}] (* _Harvey P. Dale_, Sep 18 2016 *)

%o (Magma) &cat[[2,4,6,8,1,3,5,7,0]^^10]; // _Vincenzo Librandi_, Jan 30 2016

%K nonn

%O 0,1

%A _Paul Curtz_, Oct 27 2008

%E Edited by _R. J. Mathar_, Dec 08 2008