OFFSET
1,2
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..10000
MAPLE
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
MATHEMATICA
Do[If[ !PrimeQ[n]&&Equal[Mod[n, 6], 1 ], Print[n]], {n, 1, 1000}]
DeleteCases[6*Range[0, 150]+1, _?PrimeQ] (* Harvey P. Dale, Jun 23 2014 *)
PROG
(GAP) Filtered(List([0..110], k->6*k+1), n->not IsPrime(n)); # Muniru A Asiru, Mar 12 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Feb 24 2004
STATUS
approved