The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276127 a(n) = p_1 + p_2 + ... + p_k, where p_1*p_2*...*p_k is the prime factorization of A064413(n). 2
 1, 2, 4, 5, 3, 6, 7, 6, 7, 5, 8, 8, 9, 7, 10, 9, 8, 9, 13, 11, 14, 9, 10, 10, 12, 11, 15, 13, 16, 10, 10, 19, 17, 20, 12, 21, 19, 22, 11, 11, 15, 25, 23, 26, 11, 12, 17, 11, 13, 14, 13, 12, 16, 18, 14, 31, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Peter Kagey, Table of n, a(n) for n = 1..10000 FORMULA a(1) = 1 a(n) = A001414(A064413(n)) for n > 1. - Peter Kagey, Sep 15 2016 EXAMPLE For instance, a(4) = 5 because A064413(4) = 6, and 6 = 2*3; 2 + 3 = 5. PROG (Haskell) a276127 1 = 1 a276127 n = a001414 \$ a064413 n -- Peter Kagey, Sep 15 2016 CROSSREFS Cf. A001414, A064413. Sequence in context: A284561 A061728 A332017 * A182115 A362962 A065182 Adjacent sequences: A276124 A276125 A276126 * A276128 A276129 A276130 KEYWORD nonn,easy AUTHOR Alec Jones, Sep 05 2016 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.

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)