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 A262565 #19 Sep 19 2016 09:30:37
%S A262565 2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,
%T A262565 3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,
%U A262565 5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5,3,2,2,3,5,5
%N A262565 A weaver's answer to the question "What comes next after 2,3,5?".
%C A262565 a(n+1) - a(n) = A186809(n). - _Reinhard Zumkeller_, Oct 19 2015
%H A262565 E. R. Berlekamp, <a href="/A257113/a257113.pdf">A contribution to mathematical psychometrics</a>, Unpublished Bell Labs Memorandum, Feb 08 1968 [Annotated scanned copy]
%H A262565 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1).
%t A262565 t = Prime@ Range@ 3; Flatten@ Table[{t, Reverse@ t}, {16}] (* _Michael De Vlieger_, Oct 20 2015 *)
%t A262565 PadRight[{},120,{2,3,5,5,3,2}] (* or *) LinearRecurrence[{1,-1,1,-1,1},{2,3,5,5,3},120] (* _Harvey P. Dale_, Sep 19 2016 *)
%o A262565 (Haskell)
%o A262565 a262565 n = a262565_list !! (n-1)
%o A262565 a262565_list = cycle [2,3,5,5,3,2] -- _Reinhard Zumkeller_, Oct 19 2015
%Y A262565 Cf. A262564, A186809.
%K A262565 nonn
%O A262565 1,1
%A A262565 _N. J. A. Sloane_, Oct 19 2015
%E A262565 Typo in link fixed by _Zak Seidov_, Oct 20 2015