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 A158233 #6 Feb 03 2019 01:21:51 %S A158233 6,4,3,0,3,6,0,3,0,0,4,0,0,4,6,0,0,6,0,6,0,0,6,3,0,3,6,3,4,0,0,4,0,0, %T A158233 4,0,0,6,3,0,3,6,0,0,3,0,0,6,0,6,0,0,3,3,6,4,0,0,4,0,0,4,0,0,4,3,0,3, %U A158233 0,0,0,3,0,6,6,0,3,6,0,3,0,0,0,3,0,6,6,0,3,0,0,4,0,0,4,0,0,4,0,0,4,0,0,4,6 %N A158233 a(n) = A120070(n+1)*A120070(n+2) mod 9. %C A158233 Conjecture: this contains only the numbers 0,3,4,6 (verified for the first 5000 terms). %C A158233 This multiply-modulo transformation is also used in the unrelated A157742, A158012, A158068, A158090. %p A158233 A120070 := proc(m,n) if m-1 >= n then m^2-n^2; else 0; fi; end: %p A158233 A120070flat := proc(n) i := 2 ; for m from 2 do for l from 1 to m-1 do if i = n then RETURN(A120070(m,l)) ; else i := i+1 ; fi; od: od: end: %p A158233 A158233 := proc(n) (A120070flat(n+1)*A120070flat(n+2) ) mod 9 ; end: seq(A158233(n),n=1..180) ; # _R. J. Mathar_, Apr 09 2009 %K A158233 nonn %O A158233 1,1 %A A158233 _Paul Curtz_, Mar 14 2009 %E A158233 Edited and extended by _R. J. Mathar_, Apr 09 2009