The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A358213 The index of the first occurrence of A002110(n) in A356309. 3
 1, 2, 3, 10, 35, 77, 286, 2431, 4199, 37145 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS A subsequence of A356314, and probably also of A356316 (from a(2)=3 onward of A356318 as well). Also, from a(2)=3 onward conjectured to be the positions of records in A356302 (after its initial zero), while A358214 gives the conjectured record values. LINKS Table of n, a(n) for n=0..9. Index entries for sequences related to primorial numbers FORMULA A356309(a(n)) = a(n) + A358214(n). a(n) = A002110(n) - A358214(n). MATHEMATICA f[nn_] := Block[{m = 1, i = 1, n = nn, p}, While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m]; q = P = 1; Reap[Do[k = j; While[! CoprimeQ[j, f[k]], k++]; If[k == P, Sow[j]; P *= Prime[q]; q++], {j, 0, 2500}] ][[-1, -1]] (* Michael De Vlieger, Nov 06 2022 *) PROG (PARI) \\ Very slow: A002110(n) = prod(i=1, n, prime(i)); A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; A356309(n) = { my(j=n); while(gcd(A276086(j), n)!=1, j++); (j); }; A358213(n) = { my(x=A002110(n)); for(i=0, oo, if(A356309(i)==x, return(i))); }; CROSSREFS Cf. A002110, A356302, A356309, A356314, A356316, A356318, A358214. Sequence in context: A344573 A300127 A059735 * A356926 A134959 A270367 Adjacent sequences: A358210 A358211 A358212 * A358214 A358215 A358216 KEYWORD nonn,hard,more AUTHOR Antti Karttunen, Nov 05 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.

Last modified April 14 18:28 EDT 2024. Contains 371667 sequences. (Running on oeis4.)