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 A074396 #6 Jun 24 2014 01:08:25 %S A074396 5,3,1,9,9,3,1,3,1,9,9,9,1,3,9,1,9,3,9,1,9,1,3,1,9,9,3,9,3,1,3,9,1,9, %T A074396 3,1,9,1,3,1,1,9,1,3,1,1,9,3,9,9,3,1,9,1,3,3,1,9,3,9,9,3,3,1,9,1,9,3, %U A074396 9,3,9,3,9,1,1,3,1,1,1,1,9,9,1,1,3,1,3,3,1,1,1,3,3,3,9,1,9,9,9,3,9,1,3,3,1 %N A074396 a(n) = 10 - (p mod 10), where p is the n-th prime congruent to 1 (mod 4) for which p+2 is also prime. %e A074396 The first 5 such primes are 5, 17, 29, 41, 101. For these, 10 - (p mod 10) is 5, 3, 1, 9, 9. %t A074396 10-Mod[ #, 10]&/@Select[Prime/@Range[1500], PrimeQ[ #+2]&&Mod[ #, 4]==1&] %Y A074396 Cf. A071695. %K A074396 nonn %O A074396 1,1 %A A074396 _Roger L. Bagula_, Sep 24 2002 %E A074396 Edited by _Dean Hickerson_, Oct 09 2002