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 A049342 #27 Feb 19 2024 01:56:34 %S A049342 1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2, %T A049342 3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2, %U A049342 2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2,1,3,1,1,2,3,2,2 %N A049342 a(n) = A049341(n)/3. %H A049342 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a> %H A049342 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,1). %F A049342 Period 8: repeat (1, 2, 3, 2, 2, 1, 3, 1). %F A049342 a(n) = 3 - (Fibonacci(n+6) mod 3). - _Gary Detlefs_, Mar 13 2011 %t A049342 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{1, 2, 3, 2, 2, 1, 3, 1},93] (* _Ray Chandler_, Aug 27 2015 *) %K A049342 nonn %O A049342 0,2 %A A049342 _N. J. A. Sloane_