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 A216329 #29 Jan 01 2025 15:41:14 %S A216329 37,78,124,139,154,180,234,276,288,291,310,331,436,444,499,532,558, %T A216329 609,616,624,648,696,706,717,750,820,856,873,894,951,961,973,1047, %U A216329 1072,1099,1114,1188,1270,1309,1347,1351,1356,1366,1383,1414,1419,1429,1447,1473 %N A216329 Decades whose prime pattern is the same as the prime pattern in the next decade, with at least one prime. %H A216329 V. Raman, <a href="/A216329/b216329.txt">Table of n, a(n) for n = 1..10000</a> %F A216329 a(n) >> n log^2 n. - _Charles R Greathouse IV_, Sep 06 2012 %F A216329 a(n) = A219997(n) - 1. - _V. Raman_, Dec 08 2012 %t A216329 ps0 = {2, 3, 5, 7}; n = 0; t = {}; While[Length[t] < 50, n++; ps1 = Select[Range[10 n, 10 n + 9], PrimeQ]; If[Length[ps0] > 0 && Length[ps0] == Length[ps1] && ps0 + 10 == ps1, AppendTo[t, n - 1]]; ps0 = ps1]; t (* _T. D. Noe_, Sep 04 2012 *) %o A216329 (PARI) isok(i) = { isprime(10*i+1)==isprime(10*i+11) && isprime(10*i+3)==isprime(10*i+13) && isprime(10*i+7)==isprime(10*i+17) && isprime(10*i+9)==isprime(10*i+19) && isprime(10*i+1)+isprime(10*i+3)+isprime(10*i+7)+isprime(10*i+9)>=1 } \\ _V. Raman_, Dec 08 2012 %Y A216329 Cf. A190639. %Y A216329 Cf. A219997 (upper decade). %K A216329 nonn,base %O A216329 1,1 %A A216329 _V. Raman_, Sep 04 2012