cp's OEIS Frontend

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.

A023263 Primes that remain prime through 2 iterations of function f(x) = 8x + 7.

This page as a plain text file.
%I A023263 #29 Mar 16 2025 02:37:32
%S A023263 2,5,107,137,179,197,227,359,419,617,659,839,977,1097,1217,1409,1487,
%T A023263 1559,1637,2087,2339,2447,2549,2609,2687,2909,2957,3167,3299,3467,
%U A023263 3719,4139,4409,4787,4919,4937,5147,5189,5279,5639,6047,6269,7229,7547,7949
%N A023263 Primes that remain prime through 2 iterations of function f(x) = 8x + 7.
%C A023263 Primes p such that 8*p+7 and 64*p+63 are also primes. - _Vincenzo Librandi_, Aug 04 2010
%H A023263 Harvey P. Dale, <a href="/A023263/b023263.txt">Table of n, a(n) for n = 1..1000</a>
%t A023263 Select[Prime[Range[1100]],And@@PrimeQ[NestList[8#+7&,#,2]]&] (* _Harvey P. Dale_, Jul 22 2013 *)
%o A023263 (Magma) [n: n in [1..100000] | IsPrime(n) and IsPrime(8*n+7)and IsPrime(64*n+63)]; // _Vincenzo Librandi_, Aug 04 2010
%K A023263 nonn
%O A023263 1,1
%A A023263 _David W. Wilson_