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.

A365385 a(n) = A331410(A163511(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Sep 03 2023

Keywords

Crossrefs

Cf. A131577 (positions of 0's).
Cf. also A334204, A364260.

Programs

  • PARI
    A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
    A331410(n) = if(!bitand(n,n-1),0,1+A331410(n+(n/vecmax(factor(n)[, 1]))));
    A365385(n) = A331410(A163511(n));

Formula

For all n >= 1, a(n) = a(2*n) = a(A000265(n)).