This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A278499 #6 Nov 27 2016 22:07:35 %S A278499 0,3,2,0,3,3,0,2,1,0,3,2,0,3,2,0,3,1,0,3,1,0,3,3,0,3,2,0,3,2,0,3,1,0, %T A278499 2,1,0,3,2,1,0,0,3,1,0,3,2,0,3,2,0,3,3,0,3,1,0,3,2,0,2,1,0,3,1,0,3,3, %U A278499 2,1,0,3,2,0,3,3,2,1,0,3,1,0,3,3,1,0,0,3,1,0,3,3,0,3,1,0,3,2,0,3,1,0,3,2,0,3,2,0,2,1,0,2,1,0,3,2,0,3,2,0,3 %N A278499 a(n) = A276573(n) modulo 4. %C A278499 No subsequence 2, 3 will ever occur. %H A278499 Antti Karttunen, <a href="/A278499/b278499.txt">Table of n, a(n) for n = 0..10028</a> %F A278499 a(n) = A010873(A276573(n)) = A276573(n) modulo 4. %o A278499 (Scheme) (define (A278499 n) (modulo (A276573 n) 4)) %Y A278499 Cf. A002828, A010873, A276573, A276575, A278497, A278498. %K A278499 nonn %O A278499 0,2 %A A278499 _Antti Karttunen_, Nov 25 2016