The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363172 Primitive terms of A363171: terms of A363171 with no proper divisor in A363171. 2
6, 10, 14, 44, 52, 105, 136, 152, 184, 232, 248, 286, 374, 418, 442, 495, 506, 592, 656, 688, 752, 848, 944, 976, 1292, 1564, 1748, 1755, 1972, 2108, 2144, 2145, 2204, 2272, 2336, 2356, 2516, 2528, 2656, 2668, 2788, 2805, 2812, 2848, 2852, 2924, 2925, 3104, 3116 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If k is a term then m*k is a term of A363171 for all m >= 1.
The least odd term is a(6) = 105, and the least term that is coprime to 6 is a(34832) = 37182145.
LINKS
MATHEMATICA
q[n_] := DivisorSigma[-1, n * Times @@ FactorInteger[n][[;; , 1]]] > 2; primQ[n_] := q[n] && AllTrue[Divisors[n], # == n || ! q[#] &]; Select[Range[3200], primQ]
PROG
(PARI) A064549(n) = { my(f=factor(n)); prod(i=1, #f~, f[i, 1]^(f[i, 2]+1)); };
isA363171(n) = sigma(A064549(n), -1) > 2;
is(n) = { if(!isA363171(n), return(0)); fordiv(n, d, if(d < n && isA363171(d), return(0))); return(1) };
CROSSREFS
Cf. A363171.
Sequence in context: A259021 A171251 A074980 * A059218 A362600 A361606
KEYWORD
nonn
AUTHOR
Amiram Eldar, May 19 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 16:13 EDT 2024. Contains 373063 sequences. (Running on oeis4.)