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!)
A335881 a(n) = max(A329697(n), A331410(n)). 7
0, 0, 1, 0, 2, 1, 2, 0, 2, 2, 2, 1, 2, 2, 3, 0, 3, 2, 3, 2, 3, 2, 3, 1, 4, 2, 3, 2, 4, 3, 3, 0, 3, 3, 3, 2, 4, 3, 3, 2, 3, 3, 4, 2, 4, 3, 4, 1, 4, 4, 4, 2, 4, 3, 4, 2, 4, 4, 4, 3, 3, 3, 4, 0, 4, 3, 4, 3, 4, 3, 4, 2, 5, 4, 5, 3, 4, 3, 4, 2, 4, 3, 3, 3, 5, 4, 5, 2, 5, 4, 4, 3, 4, 4, 5, 1, 3, 4, 4, 4, 5, 4, 3, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = max(A329697(n), A331410(n)).
For all n >= 1, A335904(n) >= A335884(n) >= a(n) >= A335875(n) >= A335885(n).
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)))); };
A335881(n) = max(A329697(n), A331410(n));
CROSSREFS
Cf. A329662 (apparently the positions of records).
Sequence in context: A217921 A272328 A334956 * A239703 A029338 A240883
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 April 24 06:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)