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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A361469 a(n) = bigomega(A249670(A003961(n))). 1
 0, 3, 3, 3, 4, 4, 4, 7, 3, 7, 3, 4, 4, 5, 7, 6, 4, 6, 5, 7, 7, 6, 4, 6, 4, 5, 7, 5, 6, 8, 3, 9, 6, 7, 8, 6, 4, 6, 7, 11, 4, 8, 6, 4, 7, 5, 5, 7, 4, 5, 5, 3, 5, 8, 5, 9, 8, 9, 3, 8, 4, 6, 7, 7, 8, 7, 6, 7, 5, 9, 3, 8, 6, 5, 7, 6, 7, 8, 5, 10, 6, 7, 5, 6, 8, 7, 9, 10, 4, 10, 8, 5, 6, 6, 9, 10, 4, 7, 6, 5, 5, 6, 6, 7, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture: There are no 1's in this sequence. If true, it would imply that there are no odd terms in A065997. The first n with a(n) = 2 is 1684804. Note that A003961(1684804) = 5659641 is so far the only known odd term in A247086. LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..100000 Index entries for sequences computed from indices in prime factorization Index entries for sequences related to sigma(n) FORMULA a(n) = A001222(A361468(n)) = A001222(A249670(A003961(n))). PROG (PARI) A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961 A249670(n) = { my(ab = sigma(n)/n); numerator(ab)*denominator(ab); }; A361469(n) = bigomega(A249670(A003961(n))); CROSSREFS Cf. A001222, A003961, A065997, A247086, A249670, A361468. Sequence in context: A327469 A105590 A220845 * A073750 A270059 A120204 Adjacent sequences: A361466 A361467 A361468 * A361470 A361471 A361472 KEYWORD nonn AUTHOR Antti Karttunen, Mar 20 2023 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 June 10 05:41 EDT 2023. Contains 363195 sequences. (Running on oeis4.)