login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056175 Number of non-unitary prime divisors of the central binomial coefficient C(n, floor(n/2)) (A001405). 5
0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 2, 2, 3, 3, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 3, 2, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 2, 2, 0, 1, 1, 1, 2, 2, 3, 3, 1, 2, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 3, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

COMMENTS

Nonunitary prime divisors are the prime divisors of largest square dividing the number: a(n)=A001221[A000188[A001405[n]]]=A001221[A056057[n]]

FORMULA

A prime divisor is not unitary iff its exponent exceeds 1.

EXAMPLE

n=10, binomial[10, 5]=252=2.2.3.3.7 has 3 prime divisors of which only 1, p=7 is unitary, while 2, 3 are not. So a(10)=2. n=256, binomial[256, 128] also has only 2 prime divisors, 3 and 13, whose exponents are >1, 4 or 2 resp., thus a(256)=2.

CROSSREFS

Cf. A001405, A001221, A034444, A034973, A039593, A056057, A056173.

Sequence in context: A091430 A059282 A161849 * A105241 A134541 A154782

Adjacent sequences:  A056172 A056173 A056174 * A056176 A056177 A056178

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 27 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:30 EST 2012. Contains 206014 sequences.