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.

A046132 Larger member p+4 of cousin primes (p, p+4).

This page as a plain text file.
%I A046132 #47 Apr 02 2025 20:30:43
%S A046132 7,11,17,23,41,47,71,83,101,107,113,131,167,197,227,233,281,311,317,
%T A046132 353,383,401,443,461,467,491,503,617,647,677,743,761,773,827,857,863,
%U A046132 881,887,911,941,971,1013,1091,1097,1217,1283,1301,1307,1427,1433
%N A046132 Larger member p+4 of cousin primes (p, p+4).
%C A046132 A pair of cousin primes are primes of the form p and p+4 (where p+2 may or may not be a prime). - _N. J. A. Sloane_, Mar 18 2021
%H A046132 Reinhard Zumkeller, <a href="/A046132/b046132.txt">Table of n, a(n) for n = 1..10000</a>
%H A046132 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CousinPrimes.html">Cousin Primes</a>
%H A046132 Wikipedia, <a href="https://en.wikipedia.org/wiki/Cousin_prime">Cousin prime</a>.
%F A046132 a(n) = A023200(n) + 4 = A087679(n) + 2.
%F A046132 a(n) = 3*A157834(n-1) + 2 = A029710(n-1) + 4 = 6*A056956(n-1) + 5 (thus a(n) mod 6 == 5), for all n>1. - _M. F. Hasler_, Jan 15 2013
%t A046132 lst={};Do[p=Prime[n];If[PrimeQ[p4=p+4], (*Print[p4];*)AppendTo[lst, p4]], {n, 10^2}];lst (* _Vladimir Joseph Stephan Orlovsky_, Aug 21 2008 *)
%t A046132 Select[Prime[Range[300]],PrimeQ[#+4]&]+4 (* _Harvey P. Dale_, Dec 15 2017 *)
%o A046132 (PARI) forprime(p=2,1e5,if(isprime(p-4),print1(p", "))) \\ _Charles R Greathouse IV_, Jul 15 2011
%o A046132 (Haskell)
%o A046132 a046132 n = a046132_list !! (n-1)
%o A046132 a046132_list = filter ((== 1) . a010051') $ map (+ 4) a000040_list
%o A046132 -- _Reinhard Zumkeller_, Aug 01 2014
%Y A046132 Essentially the same as A031505. Cf. A023200, A029710, A098429.
%Y A046132 Cf. A000040, A010051.
%K A046132 nonn
%O A046132 1,1
%A A046132 _Eric W. Weisstein_