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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065347 Positions of zeros in A065344, i.e. Mod[binomial[2n,n],(n+1)*(n+2)] = 0. 1
3, 5, 8, 9, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 29, 32, 33, 35, 36, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) { n=0; for (m=1, 10^9, if (binomial(2*m, m) % ((m + 1)*(m + 2)) == 0, write("b065347.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 17 2009]

CROSSREFS

A000108, A065344-A065349

Sequence in context: A190205 A192884 A134427 * A085722 A023980 A189029

Adjacent sequences:  A065344 A065345 A065346 * A065348 A065349 A065350

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 30 2001

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 16 08:13 EST 2012. Contains 205893 sequences.