cp's OEIS Frontend

A082999 a(n) = A046195(n) mod 5.

%I A082999 #15 Mar 03 2024 12:17:07
%S A082999 1,1,4,1,4,0,4,0,4,0,4,1,4,1,1,1,1,4,1,4,0,4,0,4,0,4,1,4,1,1,1,1,4,1,
%T A082999 4,0,4,0,4,0,4,1,4,1,1,1,1,4,1,4,0,4,0,4,0,4,1,4,1,1,1,1,4,1,4,0,4,0,
%U A082999 4,0,4,1,4,1,1,1,1,4,1,4,0,4,0,4,0,4,1,4,1,1,1,1,4,1,4,0,4,0,4,0,4,1,4,1,1
%N A082999 a(n) = A046195(n) mod 5.
%C A082999 Sequence only consists of 0, 1, 4 mod 5.
%H A082999 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1).
%F A082999 a(n)= +a(n-1) -a(n-3) +a(n-4) -a(n-6) +a(n-7) -a(n-9) +a(n-10) -a(n-12) +a(n-13). - _R. J. Mathar_, Jul 27 2010
%e A082999 a(2)=1 because A046195(2)=6=1 mod 5.
%p A082999 A046195 := proc(n) option remember; if n <= 7 then op(n,[1, 6, 49, 961, 8214, 70225, 1385329 ]) ; else procname(n-1)+1442*procname(n-3) -1442*procname(n-4)-procname(n-6) +procname(n-7) ; end if; end proc:
%p A082999 A082999 := proc(n) A046195(n) mod 5 ; end proc: seq(A082999(n),n=1..120) ;
%p A082999 # _R. J. Mathar_, Jul 27 2010
%t A082999 LinearRecurrence[{1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1}, {1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4}, 100] (* _Vincenzo Librandi_, Aug 07 2015 *)
%o A082999 (Magma) I:=[1,1,4,1,4,0,4,0,4,0,4,1,4]; [n le 13 select I[n] else + Self(n-1) - Self(n-3) + Self(n-4) - Self(n-6) + Self(n-7) - Self(n-9) + Self(n-10) - Self(n-12) + Self(n-13): n in [1..100]]; // _Vincenzo Librandi_, Aug 07 2015
%Y A082999 Cf. A046195.
%K A082999 nonn
%O A082999 1,3
%A A082999 _Jon Perry_, May 30 2003
%E A082999 More terms from _R. J. Mathar_, Jul 27 2010