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 A110269 #12 Jun 02 2019 13:30:01
%S A110269 0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,
%T A110269 1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,
%U A110269 2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2,1,1,3,0,2,2
%N A110269 n mod 2 + n mod 3.
%H A110269 Harvey P. Dale, <a href="/A110269/b110269.txt">Table of n, a(n) for n = 0..1000</a>
%H A110269 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (-1,0,1,1).
%F A110269 a(n) = A000035(n) + A010872(n).
%F A110269 G.f.: -x*(2+4*x+3*x^2) / ( (x-1)*(1+x)*(1+x+x^2) ). - _R. J. Mathar_, Mar 06 2014
%t A110269 Table[Mod[n,2]+Mod[n,3],{n,0,120}] (* or *) LinearRecurrence[{-1,0,1,1},{0,2,2,1},120] (* or *) PadRight[{},120,{0,2,2,1,1,3}] (* _Harvey P. Dale_, Jun 02 2019 *)
%Y A110269 Cf. A110270.
%K A110269 nonn,easy
%O A110269 0,2
%A A110269 _Reinhard Zumkeller_, Jul 18 2005