Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094496
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
OFFSET

0,41

COMMENT

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 this_sequence A010112 A058963 A066608

Adjacent sequences: A094493 A094494 A094495 this_sequence A094497 A094498 A094499

KEYWORD

easy,nonn,tabl

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research