The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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; text; internal format)
OFFSET
0,41
COMMENTS
a[0]=1 by convention.
LINKS
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
Sequence in context: A263164 A132591 A116232 * A010112 A058963 A243775
KEYWORD
easy,nonn,tabl
AUTHOR
Labos Elemer, Jun 02 2004
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 May 14 21:33 EDT 2024. Contains 372533 sequences. (Running on oeis4.)