Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094495
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094495 a[n]=Mod[C[n,j],n^2], binomial coefficients mod n^2, the square of n, read by rows. +0
3
0, 0, 0, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 1, 1, 6, 15, 20, 15, 6, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 8, 28, 56, 6, 56, 28, 8, 1, 1, 9, 36, 3, 45, 45, 3, 36, 9, 1, 1, 10, 45, 20, 10, 52, 10, 20, 45, 10, 1, 1, 11, 55, 44, 88, 99, 99, 88, 44, 55, 11, 1, 1, 12, 66, 76, 63, 72, 60 (list; table; graph; listen)
page 1

Search completed in 0.001 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research