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.

A075521 Primes p such that 4*p + (p mod 4) is also a prime.

This page as a plain text file.
%I A075521 #16 Nov 21 2013 13:07:13
%S A075521 7,11,13,19,31,37,47,59,67,73,97,107,151,179,193,227,271,277,307,331,
%T A075521 359,367,373,409,433,439,467,487,499,571,577,587,599,647,673,691,709,
%U A075521 719,839,853,907,991,997,1019,1031,1033,1039,1093,1129,1187,1259,1279
%N A075521 Primes p such that 4*p + (p mod 4) is also a prime.
%C A075521 A075522(a(n)) > 1.
%C A075521 A010051(A075520(A049084(a(n)))) = 1. [_Reinhard Zumkeller_, Feb 20 2012]
%H A075521 Reinhard Zumkeller, <a href="/A075521/b075521.txt">Table of n, a(n) for n = 1..10000</a>
%e A075521 11 is a term as 4*11+(11 mod 4) = 44+3 = 47 is prime.
%t A075521 Select[Prime[Range[300]], PrimeQ[4*# + Mod[#, 4]] &] (* _Vladimir Joseph Stephan Orlovsky_, Feb 17 2012 *)
%o A075521 (Haskell)
%o A075521 a075521 n = a075521_list !! (n-1)
%o A075521 a075521_list = map a000040 $ filter ((== 1) . a010051' . a075520) [1..]
%o A075521 -- _Reinhard Zumkeller_, Feb 20 2012
%K A075521 nonn
%O A075521 1,1
%A A075521 _Reinhard Zumkeller_, Sep 19 2002