|
Search: id:A147844
|
|
|
| A147844 |
|
Difference between the number of distinct prime divisors of (2n)!/n!^2 and Pi(2n). |
|
+0
1
|
|
| 0, 0, 1, 1, 1, 1, 2, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 2, 3, 4, 5, 5, 5, 5, 6, 4, 3, 5, 6, 5, 4, 5, 5, 6, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 7, 7, 8, 9, 8, 8, 10, 10, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 9, 10, 11, 11, 10, 10, 10, 10, 11, 10, 10, 11, 10, 10, 11, 11, 12, 12, 11, 12, 12, 12, 13, 13
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
The expression (2n)!/n!^2 is taken from C(2n+1,n+1) - C(2n,n) =
(2n)!/(n!^2*(n/(n+1)) = sum(k=1,n,C(n,k)*C(n,k-1)). This was posed in the
Yahoo Group MathForFun. A recent thread is shown in the link.
|
|
LINKS
|
MathForFun, Binomial Identity
|
|
FORMULA
|
Pi(x): number of primes <= n or the prime counting function.
omega(x): number of distinct prime divisors of x.
C(n,k): number of combinations of n things taken k at a time = n!/((n-k)!k!).
|
|
EXAMPLE
|
(2*10)!/10!^2 = 184756 = 2*2*11*13*17*19 which has 5 distinct divisors. Pi(2*10) = 8. 8-5=3 = a(10).
|
|
PROGRAM
|
(PARI) g2(n) = for(x=1, n, ct=omega((2*x)!/x!^2); print1(primepi(2*x)-ct", "))
|
|
CROSSREFS
|
Cf. A001791
Sequence in context: A006641 A115756 A067731 this_sequence A130634 A053735 A033667
Adjacent sequences: A147841 A147842 A147843 this_sequence A147845 A147846 A147847
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Nov 15 2008
|
|
EXTENSIONS
|
Corrected the link. - Cino Hilliard (hillcino368(AT)hotmail.com), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
