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 A137751 #5 Jul 10 2017 14:55:26
%S A137751 0,0,0,0,4,4,4,7,4,19,12,8,22,10,32,16,22,36,16,27,16,30,20,72,28,66,
%T A137751 24,74,60,80,30,49,28,106,88,114,44,40,40,36,67,119,72,44,48,183,181,
%U A137751 54,56,149,212,90,138,94,64,178,156,102
%N A137751 a(n) = number of missing residues in the Fibonacci sequence mod the n-th prime number.
%H A137751 Alois P. Heinz, <a href="/A137751/b137751.txt">Table of n, a(n) for n = 1..10000</a>
%H A137751 Casey Mongoven, <a href="http://caseymongoven.com/catalogue/b741.htm">Absent Residues Primes no. 1</a>; electro-acoustic music created with this sequence.
%e A137751 The 5th prime number is 11. The Fibonacci sequence mod 11 is {0,1,1,2,3,5,8,2,10,1,0,1,...} - a periodic sequence. There are 4 residues which do not occur in this sequence, namely {4,6,7,9}. So a(5) = 4.
%Y A137751 Cf. A118965, A137750, A000045.
%K A137751 nonn
%O A137751 1,5
%A A137751 _Casey Mongoven_, Feb 10 2008