cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A358213 The index of the first occurrence of A002110(n) in A356309.

Original entry on oeis.org

1, 2, 3, 10, 35, 77, 286, 2431, 4199, 37145
Offset: 0

Views

Author

Antti Karttunen, Nov 05 2022

Keywords

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.

Crossrefs

Programs

  • 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 *)
  • 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))); };

Formula

A356309(a(n)) = a(n) + A358214(n).
a(n) = A002110(n) - A358214(n).