|
%I #18 Mar 12 2019 04:08:54
%S 1,25,49,55,85,91,115,121,133,145,169,175,187,205,217,235,247,253,259,
%T 265,289,295,301,319,325,343,355,361,385,391,403,415,427,445,451,469,
%U 475,481,493,505,511,517,529,535,553,559,565,583,589,595,625,637,649
%N Nonprimes of the form 6k + 1.
%H Nathaniel Johnston, <a href="/A091300/b091300.txt">Table of n, a(n) for n = 1..10000</a>
%p for k from 0 to 100 do if(not isprime(6*k+1))then printf("%d, ",6*k+1); fi: od: # _Nathaniel Johnston_, May 18 2011
%t Do[If[ !PrimeQ[n]&&Equal[Mod[n, 6], 1 ], Print[n]], {n, 1, 1000}]
%t DeleteCases[6*Range[0,150]+1,_?PrimeQ] (* _Harvey P. Dale_, Jun 23 2014 *)
%o (GAP) Filtered(List([0..110],k->6*k+1),n->not IsPrime(n)); # _Muniru A Asiru_, Mar 12 2019
%Y Cf. A091113, A092256.
%Y Cf. A002476. Subsequence of A016921.
%K easy,nonn
%O 1,2
%A _Labos Elemer_, Feb 24 2004
|
