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.

A342015 a(n) = A003415(A276086(n)) mod A276086(n).

Original entry on oeis.org

0, 1, 1, 5, 6, 3, 1, 7, 8, 1, 39, 33, 10, 45, 55, 35, 15, 255, 75, 25, 350, 325, 300, 1725, 500, 375, 250, 2375, 2625, 10875, 1, 9, 10, 41, 51, 39, 12, 59, 71, 37, 3, 321, 95, 15, 460, 395, 330, 2235, 650, 425, 200, 3025, 3225, 14325, 4125, 3875, 3625, 20375, 24000, 8625, 14, 77, 91, 35, 420, 399, 119, 483, 602, 469
Offset: 0

Views

Author

Antti Karttunen, Mar 04 2021

Keywords

Comments

No zeros after the initial a(0) = 0.

Crossrefs

Programs

  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A342015(n) = { my(u=A276086(n)); (A003415(u)%u); };

Formula

a(n) = A342014(A276086(n)).
a(n) = A327860(n) mod A276086(n).
For all n >= 0, gcd(a(n), A276086(n)) = A328572(n).