Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Sep 08 2022 08:44:56
%S 7,11,29,43,53,67,71,109,113,127,137,151,179,193,197,211,239,263,277,
%T 281,337,347,379,389,421,431,449,463,487,491,547,557,571,599,613,617,
%U 631,641,659,673,683,701,739,743
%N Primes congruent to {0, 1, 4} mod 7.
%C The same as A045469 but without the initial 7 (the only prime congruent to 0 mod 7).
%H Vincenzo Librandi, <a href="/A045461/b045461.txt">Table of n, a(n) for n = 1..3000</a>
%F a(n) ~ 3 n log n. [_Charles R Greathouse IV_, Feb 20 2012]
%t Select[Prime[Range[120]], MemberQ[{0, 1, 4}, Mod[#, 7]] &] (* From Alonso del Arte based on Orlovsky's program for A042992, Feb 18 2012 *)
%o (PARI) forprime(p=2,1e3,if((n->n<2||n==4)(p%7),print1(p", "))) \\ _Charles R Greathouse IV_, Feb 20 2012
%o (Magma) [ p: p in PrimesUpTo(1000) | p mod 7 in {0, 1, 4} ]; // _Vincenzo Librandi_, Aug 13 2012
%Y Cf. A045312 (complement).
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_