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.

A131381 a(n) = binomial(2*n,n) mod (n+2), with n>=1.

This page as a plain text file.
%I A131381 #22 Oct 06 2024 13:52:56
%S A131381 2,2,0,4,0,4,3,0,0,4,0,0,5,8,0,0,0,0,0,0,0,0,0,0,9,0,0,10,0,16,11,0,0,
%T A131381 24,0,0,26,0,0,28,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,
%U A131381 0,0,0,0,0,0,0,0,0,0,0,0,0,27,0,0,28,0,0,29,0,0,60,0,0,62,0,0,64,0,0,0,0
%N A131381 a(n) = binomial(2*n,n) mod (n+2), with n>=1.
%C A131381 Contains large zones of zeros.
%H A131381 Michael De Vlieger, <a href="/A131381/b131381.txt">Table of n, a(n) for n = 1..10000</a>
%e A131381 n=6 -> binomial(12,6) mod 8 -> 12!/(6!*6!) mod 8 -> 924 mod 8 -> 4.
%p A131381 seq(binomial(2*n,n) mod (n+2), n=1..100);
%t A131381 Table[Mod[Binomial[2n,n],n+2],{n,100}] (* _Harvey P. Dale_, Aug 23 2011 *)
%Y A131381 Cf. A118114, A131382.
%K A131381 easy,nonn
%O A131381 1,1
%A A131381 _Paolo P. Lava_ and _Giorgio Balzarotti_, Jul 05 2007
%E A131381 Offset changed to 1 by _Georg Fischer_, Oct 06 2024