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.

A340082 a(n) = A003958(n) / gcd(n-1, A003958(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 6, 4, 1, 1, 4, 1, 4, 3, 10, 1, 2, 2, 12, 4, 2, 1, 8, 1, 1, 5, 16, 12, 4, 1, 18, 12, 4, 1, 12, 1, 10, 4, 22, 1, 2, 3, 16, 16, 4, 1, 8, 20, 6, 9, 28, 1, 8, 1, 30, 12, 1, 3, 4, 1, 16, 11, 8, 1, 4, 1, 36, 16, 6, 15, 24, 1, 4, 1, 40, 1, 12, 16, 42, 28, 10, 1, 16, 4, 22, 15, 46, 36, 2, 1, 36
Offset: 1

Views

Author

Antti Karttunen, Dec 28 2020

Keywords

Crossrefs

Cf. A003958, A340081, A340083, A340085 (gives the odd part).
Cf. also A160595, A340072.

Programs

  • PARI
    A003958(n) = if(1==n,n,my(f=factor(n)); for(i=1,#f~,f[i,1]--); factorback(f));
    A340082(n) = { my(u=A003958(n)); u/gcd(n-1, u); };

Formula

a(n) = A003958(n) / A340081(n) = A003958(n) / gcd(n-1, A003958(n)).