Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Jan 30 2013 13:39:53
%S 0,1,1,2,3,5,8,13,0,5,5,10,15,4,11,15,5,12,17,8,9,9,10,11,13,3,8,11,
%T 11,14,4,10,14,3,9,12,13,4,9,13,1,6,7,13,7,12,19,10,13,2,7,9,16,4,4,8,
%U 12,12,16,7,7,14,8,14,1,7,8,15,2,9,11,12,15,6,13,6,11,17,7,8,15,2,9,11,12
%N a(n) = a(n-1) mod 13 + a(n-2) mod 8, with a(0) = 0 and a(1) = 1.
%F a(n) = a(n-1) mod 13 + a(n-2) mod 8, with a(0) = 0 and a(1) = 1.
%t a[0] = 0; a[1] = 1; a[n_] := a[n] = Mod[a[n - 1], 13] + Mod[a[n - 2], 8] aout = Table[a[n], {n, 0, 100}]
%Y Cf. A000045.
%K nonn
%O 0,4
%A _Roger L. Bagula_, May 17 2006
%E Edited by _Michel Marcus_, Jan 30 2013