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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094496 a[n]=C[n,j]-Mod[C[n,j],n^2], difference of binomial coefficients and its residue mod n^2 read by rows. 2
1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 81, 81, 81, 81, 0, 0, 0, 0, 0, 0, 100, 200, 200, 200, 100, 0, 0, 0, 0, 0, 0, 121, 242, 363, 363, 242, 121, 0, 0, 0, 0, 0, 0, 144, 432, 720, 864, 720, 432 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,41

COMMENTS

a[0]=1 by convention.

EXAMPLE

First deviation from A007318 is at a[40] because C[8,4]=70 and Mod[70,64]=6.

MATHEMATICA

Flatten[Table[Table[Binomial[n, j]-Mod[Binomial[n, j], n^2], {j, 0, n}], {n, 1, 20}], 1]

CROSSREFS

Cf. A007318, A053200, A094495, A094497.

Sequence in context: A069452 A132591 A116232 * A010112 A058963 A066608

Adjacent sequences:  A094493 A094494 A094495 * A094497 A094498 A094499

KEYWORD

easy,nonn,tabl

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 02 2004

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 23:58 EST 2012. Contains 206085 sequences.