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.

A076205 Numbers n such that 30*n+{1,7,11,13,17,19,23,29} are all composite.

This page as a plain text file.
%I A076205 #20 Sep 08 2022 08:45:07
%S A076205 360,523,654,941,1020,1047,1064,1136,1188,1213,1264,1280,1343,1355,
%T A076205 1445,1477,1515,1526,1530,1533,1582,1623,1652,1693,1842,1900,1960,
%U A076205 2018,2039,2129,2208,2280,2309,2332,2406,2413,2440,2499,2539,2622,2633,2650,2657
%N A076205 Numbers n such that 30*n+{1,7,11,13,17,19,23,29} are all composite.
%D A076205 H. S. M. Coxeter and W. O. J. Moser, Generators and Relations for Discrete Groups, 4th ed., Springer-Verlag, NY, reprinted 1984, p. 141.
%H A076205 Klaus Brockhaus, <a href="/A076205/b076205.txt">Table of n, a(n) for n = 1..6829</a> (terms < 100000)
%t A076205 Select[Range[3000],AllTrue[30#+{1,7,11,13,17,19,23,29},CompositeQ]&] (* _Harvey P. Dale_, Jan 06 2022 *)
%o A076205 (PARI) {cav(mx)= local(wp=[1,7,11,13,17,19,23,29],v=[],i,j,m); for(k=1,mx, i=k*30;j=1;m=1;while(m&&(j<9),m=!isprime(i+wp[j]);j+=1);if(m,v=concat(v,k))); return(v)}
%o A076205 (Magma) [ n: n in [0..3000] | forall{ q: q in [1, 7, 11, 13, 17, 19, 23, 29] | not IsPrime(30*n+q) } ]; // _Klaus Brockhaus_, Feb 24 2011
%Y A076205 Cf. A005776, A007775, A100418-A100423.
%K A076205 easy,nonn
%O A076205 1,1
%A A076205 _Donald S. McDonald_, Nov 02 2002
%E A076205 More terms from Ferenc Adorjan (fadorjan(AT)freemail.hu), Nov 19 2004
%E A076205 Edited by _Don Reble_, Nov 17 2005
%E A076205 Edited by _N. J. A. Sloane_, Sep 14 2008 at the suggestion of _R. J. Mathar_