login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A247191
Number of prime divisors, counted with multiplicity, of A180202(n), the product of the two numbers in the n-th amicable pair, A002025(n) * A002046(n).
1
7, 10, 8, 8, 11, 10, 10, 11, 9, 12, 12, 11, 10, 11, 11, 16, 12, 9, 12, 12, 11, 10, 10, 9, 10, 11, 12, 11, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 13, 11, 10, 10, 9, 13, 12, 12, 10, 12, 12, 10, 11, 9, 10, 14, 14, 10, 11, 13, 11, 11, 12, 10, 11, 11, 11
OFFSET
1,1
COMMENTS
Motivated by Theorem 3. in P. Pollack paper stating: Fix a natural number k. Then there are only finitely many amicable pairs (N,M) for which Omega(N*M) <= k.
LINKS
Paul Pollack, Finiteness Theorems for Perfect Numbers and Their Kin, The American Mathematical Monthly, Vol. 119, No. 8 (October 2012), pp. 670-681
FORMULA
a(n) = A001222(A180202(n)).
a(n) = A001222(A002025(n) * A002046(n)).
PROG
(PARI) lista() = {va = readvec("b002025.txt"); vb = readvec("b002046.txt"); for (i=1, 80, print1(bigomega(va[i]*vb[i]), ", ")); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Nov 23 2014
STATUS
approved