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 A204907 #6 Feb 27 2013 09:44:09 %S A204907 1,1,2,3,8,2,11,4,16,8,23,7,29,11,38,17,47,16,56,31,67,23,80,22,108, %T A204907 29,92,49,140,38,121,37,137,47,194,46,172,56,191,68,212,67,234,110, %U A204907 233,80,255,79,277,108 %N A204907 Least k such that n divides A204906(k), the k-th difference of two primes >=5. %C A204907 For a guide to related sequences, see A204892. %e A204907 a(5)=8 because 5 divides 10, which is A204906(8). %e A204907 (The 8th difference of primes>=5 is s(5)-s(2)=17-7=10.) %t A204907 (See the program at A204908.) %Y A204907 Cf. A204908, A204900, A204892. %K A204907 nonn %O A204907 1,3 %A A204907 _Clark Kimberling_, Jan 20 2012