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.

A359587 Fully multiplicative with a(p) = A008578(1+A329697(p)).

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 3, 1, 4, 2, 3, 2, 3, 3, 4, 1, 2, 4, 5, 2, 6, 3, 5, 2, 4, 3, 8, 3, 5, 4, 5, 1, 6, 2, 6, 4, 5, 5, 6, 2, 3, 6, 7, 3, 8, 5, 7, 2, 9, 4, 4, 3, 5, 8, 6, 3, 10, 5, 7, 4, 5, 5, 12, 1, 6, 6, 7, 2, 10, 6, 7, 4, 5, 5, 8, 5, 9, 6, 7, 2, 16, 3, 5, 6, 4, 7, 10, 3, 5, 8, 9, 5, 10, 7, 10, 2, 3, 9, 12, 4, 5, 4, 5, 3, 12
Offset: 1

Views

Author

Antti Karttunen, Jan 08 2023

Keywords

Crossrefs

Programs

  • PARI
    A008578(n) = if(1==n,1,prime(n-1));
    A329697(n) = if(!bitand(n, n-1), 0, 1+A329697(n-(n/vecmax(factor(n)[, 1]))));
    A359587(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 1] = A008578(1+A329697(f[i, 1]))); factorback(f); };

Formula

For n >= 1: (Start)
a(A000265(n)) = a(2*n) = a(n).
A001222(a(n)) = A087436(n),
A056239(a(n)) = A329697(n),
A318995(a(n)) = A336396(n) = A329697(A336466(n)).
(End)