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 A208847 #17 Mar 30 2012 18:52:23
%S A208847 3,4,13,15,8,14,9,5,0,11,16,10,2,12,7,1,6,16,3,10,5,8,7,16,6,11,13,6,
%T A208847 10,6,11,16,9,1,1,15,5,1,14,7,15,2,14,9,2,6,14,3,3,14,12,6,2,4,10,16,
%U A208847 6,10,9,3,3,1,7,9,11,5
%N A208847 A056915(n) mod 5228905 mod 17.
%C A208847 A056915(n) mod 5228905 mod 17 is a bijection from the set of the first 17 terms of A056915 to {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}.
%C A208847 From an algorithm based on strong pseudoprimes to bases 2,3 and 5, and a table T with the first 17 terms of A056915, we can test if n is prime, odd n, 1 < n < 42550716781. When n is a prime, we check if n belongs to T. A fast way to do that is to compute i = n mod 5228905 mod 17 and compare n with T[i]. If n is not equal to T[i], n is prime.
%C A208847 Terms computed using table by Charles R Greathouse IV. See A056915.
%H A208847 Washington Bomfim, <a href="/A208846/a208846.txt">A method to find bijections from a set of n integers to {0,1, ... ,n-1}</a>
%Y A208847 Cf. A056915, A055775, A208846.
%K A208847 nonn
%O A208847 1,1
%A A208847 _Washington Bomfim_, Mar 02 2012