(google検索) 606527267811196246600510442
:none
~~~
(google検索)
Cino prime
Cino prime number
Cino Hilliard
~~~
http://www.research.att.com/~njas/sequences/A006880
Number of primes with at most n digits; or pi(10^n).
Also omega( (10^n)! ), where omega(x): number of distinct prime divisors of x. - Cino Hilliard (hillcino368(AT)hotmail.com), Jul 04 2007
***
PROGRAM (PARI) g(n) = for(x=0, n, print1(omega((10^x)!), ", ")) - Cino Hilliard (hillcino368(AT)hotmail.com), Jul 04 2007
~~~
end
2008年5月4日日曜日
登録:
コメントの投稿 (Atom)
0 件のコメント:
コメントを投稿