The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275201 Numbers having more distinct prime factors of form 6*k+1 than of the form 6*k+5. 3
 7, 13, 14, 19, 21, 26, 28, 31, 37, 38, 39, 42, 43, 49, 52, 56, 57, 61, 62, 63, 67, 73, 74, 76, 78, 79, 84, 86, 91, 93, 97, 98, 103, 104, 109, 111, 112, 114, 117, 122, 124, 126, 127, 129, 133, 134, 139, 146, 147, 148, 151, 152, 156, 157, 158, 163, 168, 169 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 EXAMPLE 56 = 2^3 7^1, so that the number of distinct primes 6*k+1 is 1 and the number of distinct primes 6*k + 5 is 0. MATHEMATICA g[n_] := Map[First, FactorInteger[n]]; p1 = Select[Prime[Range[200]], Mod[#, 6] == 1 &]; p2 = Select[Prime[Range[200]], Mod[#, 6] == 5 &]; q1[n_] := Length[Intersection[g[n], p1]] q2[n_] := Length[Intersection[g[n], p2]] Select[Range[200], q1[#] == q2[#] &] (* A275199 *) Select[Range[200], q1[#] < q2[#] &]  (* A275200 *) Select[Range[200], q1[#] > q2[#] &]  (* A275201 *) CROSSREFS Cf. A275199, A275200. Sequence in context: A050931 A072864 A232437 * A274558 A120100 A308525 Adjacent sequences:  A275198 A275199 A275200 * A275202 A275203 A275204 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 20 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)