Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113052
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113052 Binomial(5n,n)/(4n+1) mod 5. +0
1
1, 1, 0, 0, 0, 0, 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, 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, 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 (list; graph; listen)
OFFSET

0,1

COMMENT

Conjecture: for p prime, mod(C(p*n,n)/((p-1)*n+1),p) is the indicator function of the sequence (p^n-1)/(p-1).

CROSSREFS

Sequence in context: A015780 A011642 A016338 this_sequence A117964 A094875 A012245

Adjacent sequences: A113049 A113050 A113051 this_sequence A113053 A113054 A113055

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 12 2005

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research