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.

Showing 1-3 of 3 results.

A355002 Numbers k that share a prime factor with A355456(k).

Original entry on oeis.org

135, 140, 285, 435, 455, 675, 700, 855, 885, 910, 945, 980, 1120, 1185, 1305, 1335, 1365, 1425, 1435, 1485, 1540, 1635, 1755, 1820, 1995, 2085, 2175, 2235, 2275, 2295, 2380, 2565, 2574, 2655, 2660, 2685, 2870, 2905, 2985, 3045, 3105, 3135, 3185, 3220, 3311, 3375, 3395, 3435, 3500, 3555, 3585, 3640, 3705, 3915, 4005
Offset: 1

Views

Author

Antti Karttunen, Jul 13 2022

Keywords

Comments

Numbers k such that A324198(k) and A342671(k) are not relatively prime.

Crossrefs

Programs

  • PARI
    A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A355442(n) = gcd(A003961(n), A276086(n));
    A355456(n) = gcd(sigma(n), A355442(n));
    isA355002(n) = (1!=gcd(n,A355456(n)));

A355442 a(n) = gcd(A003961(n), A276086(n)), where A003961 is fully multiplicative with a(p) = nextprime(p), and A276086 is primorial base exp-function.

Original entry on oeis.org

1, 3, 1, 9, 1, 5, 1, 3, 5, 3, 1, 5, 1, 3, 5, 9, 1, 25, 1, 3, 5, 3, 1, 5, 1, 3, 125, 9, 1, 7, 1, 3, 1, 3, 7, 5, 1, 3, 5, 63, 1, 5, 1, 3, 175, 3, 1, 5, 1, 21, 5, 9, 1, 125, 7, 3, 5, 3, 1, 7, 1, 3, 1, 9, 7, 5, 1, 3, 5, 21, 1, 25, 1, 3, 245, 9, 1, 5, 1, 21, 125, 3, 1, 5, 7, 3, 5, 9, 1, 7, 1, 3, 1, 3, 7, 5, 1, 3, 5, 441
Offset: 1

Views

Author

Antti Karttunen, Jul 13 2022

Keywords

Crossrefs

Cf. A003961, A020639, A276086, A355001 [smallest prime factor of a(n)], A355456 [= gcd(sigma(n), a(n))], A355692 (Dirichlet inverse), A355820, A355821 (positions of 1's).
Cf. also A322361, A324198, A351459.

Programs

  • PARI
    A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A355442(n) = gcd(A003961(n), A276086(n));

Formula

a(n) = gcd(A003961(n), A276086(n)).

A355818 Greatest common divisor of n, sigma(n) and A276086(n), where A276086 is primorial base exp-function.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 3, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3
Offset: 1

Views

Author

Antti Karttunen, Jul 19 2022

Keywords

Crossrefs

Sequence contains only terms of A048103.
Cf. also A355815, A327858, A355456.

Programs

Formula

a(n) = gcd(n, A324644(n)) = gcd(A000203(n), A324198(n)) = gcd(A009194(n), A276086(n)).
a(n) = gcd(A009194(n), A324198(n)).
Showing 1-3 of 3 results.