login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099905 C(2n-1,n-1) mod n. 4
0, 1, 1, 3, 1, 0, 1, 3, 1, 8, 1, 2, 1, 10, 0, 3, 1, 12, 1, 10, 3, 14, 1, 6, 1, 16, 10, 0, 1, 2, 1, 3, 21, 20, 21, 26, 1, 22, 10, 10, 1, 0, 1, 24, 0, 26, 1, 30, 1, 28, 27, 48, 1, 30, 16, 44, 48, 32, 1, 48, 1, 34, 6, 35, 35, 0, 1, 18, 33, 20, 1, 18, 1, 40, 60, 16, 0, 72, 1, 10, 10, 44, 1, 56, 75 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

For p prime, a(p)=1. For n in A058008, a(n)=0.

For n the square of a prime p>=3 or the cube of a prime p>=5, a(n)=1. - Franz Vrabec (franz.vrabec(AT)aon.at), Mar 26 2008

REFERENCES

R. J. McIntosh, On the converse of Wolstenholme's Theorem, Acta Arithm., LXXI.4 (1995), 381-389.

EXAMPLE

a(11) =352716 mod 11 =1.

MATHEMATICA

Table[Mod[Binomial[2n-1, n-1], n], {n, 90}] (* From Harvey P. Dale, Dec 12 2011 *)

CROSSREFS

Cf. A088218, A099906, A099907, A099908.

Sequence in context: A031253 A122779 A120323 * A085391 A050143 A103495

Adjacent sequences:  A099902 A099903 A099904 * A099906 A099907 A099908

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Oct 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.