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 A266951 #13 Jan 06 2024 17:37:41 %S A266951 0,5,7,13,31,109,139,199,241,283,601,619,643,823,859,883,1021,1051, %T A266951 1093,1291,1621,1873,1879,1951,2311,3001,3301,3361,3529,3583,3919, %U A266951 3931,4339,5419,5479,5851,6361 %N A266951 Record values in A266948: least prime p such that p-2 and 6n-p are also prime. %C A266951 Goldbach conjecture related. The values of A266948(n) range theoretically between 2 and n. The smaller they are, the easier it was to find a suitable twin prime, and thus the more likely the conjecture "A266948(n) > 0 for all n > 1" holds. These record values vs. the respective indices A266950 yield an estimate for the growth of an upper bound. %Y A266951 Cf. A266948, A266950. %K A266951 nonn,more %O A266951 1,2 %A A266951 _M. F. Hasler_, Jan 06 2016 %E A266951 a(28)-a(37) from _Pontus von Brömssen_, Jan 06 2024