The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335875 a(n) = min(A329697(n), A331410(n)). 8
0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 2, 1, 2, 1, 2, 0, 1, 2, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 3, 2, 1, 0, 3, 1, 3, 2, 3, 3, 3, 1, 2, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 3, 3, 3, 1, 4, 3, 4, 2, 2, 1, 3, 0, 3, 3, 4, 1, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 1, 4, 2, 3, 2, 2, 3, 4, 2, 3, 3, 3, 2, 2, 2, 4, 1, 2, 2, 4, 2, 3, 2, 3, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
LINKS
FORMULA
a(n) = min(A329697(n), A331410(n)).
For all n >= 1, A335904(n) >= A335884(n) >= A335881(n) >= a(n) >= A335885(n).
EXAMPLE
A329697(67) = A331410(67) = 4, thus a(67) = min(4,4) = 4.
A329697(15749) = 9 and A331410(15749) = 10, thus a(15749) = 9.
PROG
(PARI)
A329697(n) = { my(f=factor(n)); sum(k=1, #f~, if(2==f[k, 1], 0, f[k, 2]*(1+A329697(f[k, 1]-1)))); };
A331410(n) = { my(f=factor(n)); sum(k=1, #f~, if(2==f[k, 1], 0, f[k, 2]*(1+A331410(f[k, 1]+1)))); };
A335875(n) = min(A329697(n), A331410(n));
CROSSREFS
Sequence in context: A342846 A045888 A335885 * A107279 A078461 A341945
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 29 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 03:29 EDT 2024. Contains 373089 sequences. (Running on oeis4.)