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.

A328584 Least common multiple of n and A276086(n).

Original entry on oeis.org

0, 2, 6, 6, 36, 90, 30, 70, 120, 90, 90, 990, 300, 650, 1050, 150, 3600, 7650, 2250, 4750, 1500, 5250, 24750, 51750, 15000, 1250, 48750, 33750, 157500, 326250, 210, 434, 672, 462, 2142, 630, 1260, 2590, 3990, 2730, 2520, 25830, 1050, 15050, 23100, 3150, 72450, 148050, 42000, 12250, 5250, 89250, 409500, 834750, 236250
Offset: 0

Views

Author

Antti Karttunen, Oct 21 2019

Keywords

Crossrefs

Programs

  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A328584(n) = lcm(n, A276086(n));
    
  • PARI
    A006530(n) = if(n>1, vecmax(factor(n)[, 1]), 1); \\ From A006530.
    A328584(n) = if(!n,n,my(m=1, p=2, orgn=n, maxp = A006530(n)); while(n || (p<=maxp), m *= (p^max(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m));

Formula

a(n) = lcm(n, A276086(n)).
a(n) = A324580(n) / A324198(n).