login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071854 a(n) = (number of distinct prime factors in C(2n,n)) - pi(n). 1
1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 2, 1, 2, 1, 2, 2, 2, 0, 1, 1, 1, 1, 3, 3, 2, 1, 2, 3, 3, 3, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 4, 5, 5, 4, 4, 4, 3, 4, 3, 3, 4, 4, 5, 5, 4, 5, 5, 5, 4, 4, 4, 5, 5, 5, 4, 4, 5, 6, 5, 5, 5, 6, 5, 4, 5, 6, 5, 6, 5, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,16
LINKS
FORMULA
a(n) = A067434(n) - A000720(n)
PROG
(PARI) for(n=1, 200, print1(omega(binomial(2*n, n))-sum(i=1, n, isprime(i)), ", "))
CROSSREFS
Sequence in context: A083870 A368779 A052299 * A183025 A072410 A342824
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 09 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)