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!)
A358848 Numbers k for which A053669(6*k) [the smallest prime not dividing 6k] is of the form 6m+1. 2
5, 10, 15, 20, 25, 30, 40, 45, 50, 55, 60, 65, 75, 80, 85, 90, 95, 100, 110, 115, 120, 125, 130, 135, 145, 150, 155, 160, 165, 170, 180, 185, 190, 195, 200, 205, 215, 220, 225, 230, 235, 240, 250, 255, 260, 265, 270, 275, 285, 290, 295, 300, 305, 310, 320, 325, 330, 335, 340, 345, 355, 360, 365, 370, 375, 380, 385 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Contains only multiples of 5. Differs from A067761 by including for example 385 = 5*7*11, which is not present in A067761.
The asymptotic density of this sequence is 6 * Sum_{p prime, p == 1 (mod 6)} ((p-1)/(Product_{q prime, q <= p} q)) = 0.1738373091... . - Amiram Eldar, Dec 04 2022
LINKS
FORMULA
{k | A053669(6*k) == 1 (mod 6)}.
EXAMPLE
35 is not present as 6*35 = 210 = 2*3*5*7, and the first nondividing prime is 11, which is of the form 6m+5, not of 6m+1.
385 is present as 6*385 = 2310 = 2*3*5*7*11, and the first nondividing prime is 13, which is of the form 6m+1.
MATHEMATICA
f[n_] := Module[{p = 2}, While[Divisible[n, p], p = NextPrime[p]]; p]; Select[Range[400], Mod[f[6*#], 6] == 1 &] (* Amiram Eldar, Dec 04 2022 *)
PROG
(PARI) isA358848(n) = !A358847(n);
CROSSREFS
Positions of 0's in A358847. Complement is A358849. Subsequence of A008587.
Not the same as A067761.
Cf. A053669.
Sequence in context: A292656 A313735 A067761 * A080193 A313736 A313737
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 03 2022
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 May 19 05:24 EDT 2024. Contains 372666 sequences. (Running on oeis4.)