cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A065347 Positions of zeros in A065344, i.e., binomial(2n,n) mod ((n+1)*(n+2)) = 0.

This page as a plain text file.
%I A065347 #20 Dec 12 2024 14:53:20
%S A065347 3,5,8,9,11,12,15,16,17,18,19,20,21,22,23,24,26,27,29,32,33,35,36,38,
%T A065347 39,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,63,
%U A065347 64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,80,81,83,84,86,87,89,90
%N A065347 Positions of zeros in A065344, i.e., binomial(2n,n) mod ((n+1)*(n+2)) = 0.
%H A065347 Harry J. Smith, <a href="/A065347/b065347.txt">Table of n, a(n) for n = 1..1000</a>
%H A065347 C. Pomerance, <a href="https://math.dartmouth.edu/~carlp/catalan5.pdf">Divisors of the middle binomial coefficient</a>, Amer. Math. Monthly, 112 (2015), 636-644.
%t A065347 ris = {}; Do[If[Mod[Binomial[2 n, n], (n + 1) (n + 2)] == 0, AppendTo[ris, n]], {n, 100}]; ris (* _Bruno Berselli_, Jan 06 2014 *)
%o A065347 (PARI) isok(k) = { binomial(2*k, k) % ((k + 1)*(k + 2)) == 0 } \\ _Harry J. Smith_, Oct 17 2009
%Y A065347 Cf. A000108, A065344, A065345, A065346, A065348, A065349.
%K A065347 nonn
%O A065347 1,1
%A A065347 _Labos Elemer_, Oct 30 2001