|
%I #24 Apr 29 2022 20:12:08
%S 0,1,2,2,2,5,2,4,4,4,2,7,3,4,6,6,2,9,1,7,7,7,1,10,5,6,7,8,5,13,3,11,6,
%T 6,7,12,3,3,6,11,4,15,4,11,10,6,2,13,4,10,8,9,4,14,8,12,6,8,2,20,7,5,
%U 14,15,7,15,3,10,6,12,2,18,3,7,12,6,8,16,6,15,13,7,3,22,7,8,10,15,5
%N Total number of prime factors of the repunit R(n)=(10^n-1)/9.
%H Max Alekseyev, <a href="/A046053/b046053.txt">Table of n, a(n) for n = 1..352</a> (first 322 terms from Ray Chandler)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repunit.html">Repunit.</a>
%F a(n) = A001222(A002275(n)). - _Ray Chandler_, Apr 22 2017
%F a(n) = A057951(n) - 2. - _Ray Chandler_, Apr 24 2017
%e R(6) = 111111 = (3) (7) (11) (13) (37), so a(6) = 5.
%t Table[PrimeOmega[(10^n - 1)/9], {n, 60}] (* _Michael De Vlieger_, Apr 29 2015 *)
%o (PARI) a(n)=bigomega(10^n\9) \\ _Charles R Greathouse IV_, Apr 29 2015
%Y Cf. A001222, A002275, A057951. For the number of distinct prime factors see A095370.
%K nonn
%O 1,3
%A _Eric W. Weisstein_
|
