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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060567 Number of binomial coefficients C[n,j] with j=0...n that are divisible by C[n,2]. 0
3, 2, 1, 2, 2, 2, 4, 2, 2, 6, 5, 4, 10, 4, 2, 8, 10, 6, 12, 4, 6, 18, 10, 4, 14, 14, 6, 10, 23, 20, 22, 10, 18, 22, 10, 18, 34, 26, 15, 18, 24, 14, 32, 14, 10, 42, 28, 12, 28, 18, 12, 32, 34, 14, 25, 26, 42, 54, 30, 14, 58, 42, 22, 24, 28, 36, 60, 38, 20, 34, 44, 26, 70, 42, 20, 42 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

FORMULA

a(n)=Cardinality{j|Mod[C(n, j), C(n, 2)]=0, j=0..n}; For n=1 Mod[1, 0] does not exist.

EXAMPLE

The relevant residues are for n=16: {1, 16, 0, 80, 20, 48, 88, 40, 30, 40, 88, 48, 20, 80, 0, 16, 1}, a(16)=2; n=227: only with 6 nonzero residues: {1, 227, [111 zero], 454, 454, [111 zeros], 227, 1}

CROSSREFS

A060430, A014070.

Sequence in context: A079109 A079099 A068929 * A174543 A036583 A047878

Adjacent sequences:  A060564 A060565 A060566 * A060568 A060569 A060570

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 12 2001

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 14 10:43 EST 2012. Contains 205614 sequences.