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 A078494 #15 Sep 08 2022 08:45:08
%S A078494 97,113,127,149,181,211,241,293,307,367,397,419,421,457,479,487,557,
%T A078494 587,631,661,683,691,719,727,743,773,787,797,809,811,839,863,877,907,
%U A078494 929,937,953,967,983,1009,1021,1049,1051,1087,1117,1163,1171,1193,1201,1249
%N A078494 Primes occurring only once in their decade.
%H A078494 Alois P. Heinz, <a href="/A078494/b078494.txt">Table of n, a(n) for n = 1..10000</a>
%F A078494 a(n) ~ n log n. In particular, most primes are in this sequence. - _Charles R Greathouse IV_, Sep 07 2012
%o A078494 (PARI) decade1pr(n1,n2) = { forstep(x=n1,n2,10, if(isprime(x+1) && !isprime(x+3) && !isprime(x+7) && !isprime(x+9), print1(x+1" ");); if(isprime(x+3) && !isprime(x+1) && !isprime(x+7) && !isprime(x+9), print1(x+3" ");); if(isprime(x+7) && !isprime(x+1) && !isprime(x+3) && !isprime(x+9), print1(x+7" ");); if(isprime(x+9) && !isprime(x+1) && !isprime(x+3) && !isprime(x+7), print1(x+9" ");); ); }
%o A078494 (Magma) &cat [PrimesInInterval(10*n+1, 10*n+9): n in [0..150] | IsOne(#PrimesInInterval(10*n+1, 10*n+9))]; // _Bruno Berselli_, Sep 05 2012
%Y A078494 Cf. A078500.
%K A078494 nonn,easy,base
%O A078494 1,1
%A A078494 _Cino Hilliard_, Jan 04 2003