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 A110388 #8 Aug 15 2019 07:27:15 %S A110388 1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3,7,8, %T A110388 0,0,1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3, %U A110388 7,8,0,0,1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3,7,8,0,0,1,2,6,6,4,5,3,3,7 %N A110388 a(n) = F(n)*F(n+1) mod 9, where F(n) = n-th Fibonacci number. %e A110388 a(5) = 5*8 mod 9 = 4. %p A110388 with(combinat): a:=n->fibonacci(n)*fibonacci(n+1) mod 9: seq(a(n),n=1..130); # _Emeric Deutsch_, Jul 31 2005 %Y A110388 Cf. A007887, A001654. %K A110388 easy,nonn %O A110388 1,2 %A A110388 _Amarnath Murthy_, Jul 27 2005 %E A110388 More terms from _Emeric Deutsch_, Jul 31 2005