The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286585 a(n) = A053735(A048673(n)). 8
 1, 2, 1, 3, 2, 4, 2, 4, 3, 3, 3, 5, 1, 5, 2, 5, 2, 4, 2, 4, 2, 4, 3, 6, 5, 6, 3, 6, 4, 7, 3, 6, 3, 3, 3, 5, 3, 5, 5, 5, 4, 3, 4, 5, 4, 6, 1, 7, 5, 6, 4, 7, 2, 8, 4, 7, 4, 5, 3, 8, 4, 4, 4, 7, 4, 6, 2, 4, 5, 6, 3, 6, 4, 6, 5, 6, 4, 6, 4, 6, 7, 5, 3, 4, 5, 7, 6, 6, 5, 5, 4, 7, 3, 8, 1, 8, 5, 6, 3, 7, 6, 7, 2, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..8192 FORMULA a(n) = A053735(A048673(n)). For all n >= 0, a(A000079(n)) = n+1. PROG (Scheme) (define (A286585 n) (A053735 (A048673 n))) (Python) from sympy.ntheory.factor_ import digits from sympy import factorint, nextprime from operator import mul def a053735(n): return sum(digits(n, 3)[1:]) def a048673(n):     f = factorint(n)     return 1 if n==1 else (1 + reduce(mul, [nextprime(i)**f[i] for i in f]))/2 def a(n): return a053735(a048673(n)) print [a(n) for n in range(1, 101)] # Indranil Ghosh, Jun 12 2017 CROSSREFS Cf. A000079, A048673, A053735, A286582, A286583, A286584, A286586. Sequence in context: A317056 A286632 A308453 * A028914 A204539 A302604 Adjacent sequences:  A286582 A286583 A286584 * A286586 A286587 A286588 KEYWORD nonn AUTHOR Antti Karttunen, May 31 2017 STATUS approved

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

Last modified October 24 14:40 EDT 2020. Contains 337980 sequences. (Running on oeis4.)