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.

A243528 Integers n such that p = 4n + 1, q = 4p + 3, r = 4q + 5, s = 4r + 7 and t = 4s + 9 are all prime.

This page as a plain text file.
%I A243528 #14 Jan 18 2024 18:43:42
%S A243528 1564,4057,4654,5884,26599,30139,37204,66532,74227,80812,98137,113929,
%T A243528 124249,138604,245524,249847,250879,299767,309469,315277,340504,
%U A243528 346279,359467,362674,367069,401407,410332,435049,437377,438799,537844,550582,579814,587047
%N A243528 Integers n such that p = 4n + 1, q = 4p + 3, r = 4q + 5, s = 4r + 7 and t = 4s + 9 are all prime.
%C A243528 The first prime n is 4057.
%H A243528 Zak Seidov, <a href="/A243528/a243528_1.txt">Table of first 30 values of n, p, q, r, s, t.</a>
%e A243528 First 3 values of n, p, q, r, s and t:
%e A243528 {1564, 6257, 25031, 100129, 400523, 1602101},
%e A243528 {4057, 16229, 64919, 259681, 1038731, 4154933},
%e A243528 {4654, 18617, 74471, 297889, 1191563, 4766261}.
%t A243528 pqrstQ[n_]:=Module[{p=4n+1,q,r,s},q=4p+3;r=4q+5;s=4r+7;AllTrue[{p,q,r,s,4s+9},PrimeQ]]; Select[Range[590000],pqrstQ] (* _Harvey P. Dale_, Jan 18 2024 *)
%o A243528 (Magma) A141291:=func<h | (5*4^h-6*h-5) div 9>; [n: n in [1..10^6] | forall{i: i in [1..5] | IsPrime(4^i*n + A141291(i))}]; // _Bruno Berselli_, Jun 06 2014
%K A243528 nonn
%O A243528 1,1
%A A243528 _Zak Seidov_, Jun 06 2014