login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of prime divisors of n-th Conway and Guy second-order harmonic number (counted with multiplicity).
1

%I #9 Jan 22 2017 20:10:59

%S 0,1,1,2,2,1,2,2,1,3,2,2,2,3,2,4,3,1,2,5,3,3,2,2,1,3,3,3,1,1,2,2,2,5,

%T 2,2,2,5,1,3,4,4,3,3,3,5,4,3,3,3,2,2,6,2,3,4,2,4,2,3,3,2,4,4,4,3,3,3,

%U 3,4,2,3,4,2,2,5,3,2,2,4,4,2,2,1,6,4,2,5,3,5,1,2,2,3,4,2,3,3,3,5

%N Number of prime divisors of n-th Conway and Guy second-order harmonic number (counted with multiplicity).

%C We must include multiplicity in the definition due to terms such as a(16) = 29889983 = 19 * 31^2 * 1637. The primes are those n for which a(n) = Omega(A027612(n))= 1, namely a(2) = 5, a(3) = 13, a(6) = 223, a(9) = 4861, a(18) = 197698279, a(25) = 25472027467. The semiprimes are those for which a(n) = 2, such as when n = 4, 5, 7, 8, 11, 12, 13, 15, 19, 23, 24. The 3-almost primes are those for which a(n) = 3, as with the "3-brilliant" a(10) = 55991 = 13 * 59 * 73, a(14), a(17), a(21), a(22), a(26).

%D J. H. Conway and R. K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996, pp. 143 and 258-259.

%H G. C. Greubel, <a href="/A123369/b123369.txt">Table of n, a(n) for n = 1..150</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HarmonicNumber.html">Harmonic Number</a>, MathWorld, see discussion of Conway and Guy (1996) definition of the second-order harmonic number.

%F a(n) = A001222(A027612(n)) = Omega(Numerator of 1/n + 2/(n-1) + 3/(n-2) +...+ (n-1)/2 + n).

%e a(20) = 5 because A027612(20) = 41054655 = 3 * 5 * 23 * 127 * 937 has 5 prime factors.

%t PrimeOmega[Numerator[Table[Sum[k/(n - k + 1), {k, 1, n}], {n, 1, 50}]]] (* _G. C. Greubel_, Jan 22 2017 *)

%Y Cf. A001222 Number of prime divisors of n (counted with multiplicity), A027612 Numerator of 1/n + 2/(n-1) + 3/(n-2) +...+ (n-1)/2 + n, A027611, A001008, A002805, A001705, A006675, A093418.

%K easy,nonn

%O 1,4

%A _Jonathan Vos Post_, Nov 09 2006