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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080217 First C(n,j) binomial coefficients are reduced modulo j, j=1,..n (0 is omitted); a(n) is the number of distinct residues in n-th row i.e. when n is fixed and j runs over {1,..,n}. 2
1, 2, 2, 2, 2, 4, 4, 4, 3, 4, 4, 7, 7, 6, 5, 7, 7, 7, 7, 9, 11, 12, 12, 12, 11, 11, 10, 11, 11, 12, 12, 12, 11, 12, 12, 13, 13, 13, 17, 18, 18, 15, 15, 18, 21, 17, 17, 19, 19, 18, 17, 16, 16, 20, 20, 23, 25, 23, 23, 26, 26, 24, 22, 24, 24, 27, 27, 27, 25, 28, 28, 30, 30, 32, 31, 30 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n)=Card{Union[C(n, j), j], n=1..n}]}

EXAMPLE

n=14: {Mod[C[14,j],j],j=1..14}= {0,1,1,1,2,3,2,3,4,1,1,7,1,1,} includes {0,1,2,3,4,7} six different residues so 6=a(14).

MATHEMATICA

Table[Length[Union[Table[Mod[Binomial[n, j], j], {j, 1, n}]]], {n, 1, 256}]

CROSSREFS

Cf. A007318, A081370, A081371, A080217.

Sequence in context: A158502 A195427 A006643 * A157901 A072376 A131883

Adjacent sequences:  A080214 A080215 A080216 * A080218 A080219 A080220

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 21 2003

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 16 12:12 EST 2012. Contains 205908 sequences.