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.

A346474 a(n) = A342414(A276086(n)).

Original entry on oeis.org

0, 1, 1, 5, 1, 7, 1, 7, 1, 31, 13, 41, 1, 9, 11, 37, 2, 47, 3, 11, 7, 43, 19, 53, 1, 13, 17, 49, 11, 59, 1, 3, 5, 41, 17, 55, 1, 59, 71, 247, 53, 317, 19, 73, 23, 289, 127, 359, 13, 29, 113, 331, 37, 401, 11, 101, 67, 373, 169, 443, 1, 11, 13, 47, 5, 61, 17, 23, 43, 277, 121, 347, 1, 83, 107, 319, 71, 389, 31, 97, 8, 361, 163
Offset: 0

Views

Author

Antti Karttunen, Jul 21 2021

Keywords

Comments

For n >= 1, each term a(n) is a divisor of A342002(n).

Crossrefs

Cf. also A342002, A345930, A346475 for sequences with similar scatter plots.

Programs

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

Formula

a(n) = A342414(A276086(n)).
a(n) = A327860(n) / gcd(A327860(n), A324650(n)).