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.

A328476 Convert the primorial base expansion of n into its prime product form, then subtract the largest primorial which divides that product: a(n) = A276151(A276086(n)).

Original entry on oeis.org

0, 0, 2, 0, 8, 12, 4, 8, 14, 0, 44, 60, 24, 48, 74, 120, 224, 420, 124, 248, 374, 720, 1124, 2220, 624, 1248, 1874, 3720, 5624, 11220, 6, 12, 20, 36, 62, 120, 34, 68, 104, 0, 314, 420, 174, 348, 524, 840, 1574, 2940, 874, 1748, 2624, 5040, 7874, 15540, 4374, 8748, 13124, 26040, 39374, 78540, 48, 96, 146, 288, 440, 876, 244, 488
Offset: 0

Views

Author

Antti Karttunen, Oct 19 2019

Keywords

Crossrefs

Cf. A143293 (indices of other zeros after a(0)=0).

Programs

  • PARI
    A276151(n) = { my(s=1); forprime(p=2, , if(n%p, return(n-s), s *= p)); };
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A328476(n) = A276151(A276086(n));

Formula

a(n) = A276151(A276086(n)).
A276086(a(n)) = A276087(n) / A326810(n).