proposed
approved
proposed
approved
editing
proposed
(PARI) isok(m) = my(f=factor(m)); for (k=1, #f~, if ((f[k, 1] % 12) != 1, return(0))); return (1); \\ Michel Marcus, Jun 02 2022
proposed
editing
editing
proposed
All the prime factors of each term in this sequence are all terms of A068228.
proposed
editing
editing
proposed
Positive integers whose prime factors are all terms of A068228congruent to 1 (mod 12).
All the prime factors of each term in this sequence are congruent to 1 (mod 12)all terms of A068228.
Select[Range[10000], Count[Mod[First /@ FactorInteger[#], 12], 1] == Length[FactorInteger[#]] &]
Count[Mod[First /@ FactorInteger[#], 12], 1] ==
Length[FactorInteger[#]] &]
proposed
editing
editing
proposed
Positive Integers integers whose prime factors are all members terms of A068228.
The All the prime factors of those integers each term in this sequence are all congruent to 1 (mod 12).
Count[Mod[First /@ FactorInteger[#], 12], 1] ==
proposed
editing
editing
proposed