Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109760
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109760 Composite n such that binomial(5*n,n) == 5^n (mod n). +0
1
1, 4, 365, 400, 685, 3200, 6400, 12550, 12800, 16525, 25600 (list; graph; listen)
OFFSET

1,2

COMMENT

No more terms through 50000.

EXAMPLE

4 is a term because binomial(5*4, 4) = 4845, 5^4 = 625 and 4845 mod 4 = 625 mod 4 = 1.

MATHEMATICA

Do[If[ !PrimeQ[n], If[Mod[Binomial[5*n, n], n] == Mod[5^n, n], Print[n]]], {n, 1, 50000}]

CROSSREFS

Cf. A080469.

Adjacent sequences: A109757 A109758 A109759 this_sequence A109761 A109762 A109763

Sequence in context: A074844 A052391 A051955 this_sequence A051181 A038015 A003753

KEYWORD

hard,more,nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Aug 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research