Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131381
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A131381
%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,0,
%U A131381 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
%e A131381 n=6 -> binomial(12,6) mod 8 -> 12!/(6!*6!) mod 8 -> 924 mod 8 -> 4
%p A131381 P:=proc(n) local i,j; for i from 1 by 1 to n do j:=(binomial(2*i,i) mod 
               (i+2)); print(j); od; end: P(200);
%Y A131381 Cf. A118114, A131382.
%Y A131381 Sequence in context: A090657 A108563 A138476 this_sequence A112080 A052176 
               A138092
%Y A131381 Adjacent sequences: A131378 A131379 A131380 this_sequence A131382 A131383 
               A131384
%K A131381 easy,nonn
%O A131381 0,1
%A A131381 Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jul 05 2007

    
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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research