Search: id:A118112
Results 1-1 of 1 results found.

%I A118112
%S A118112 1,0,0,0,3,0,0,0,5,0,0,0,0,0,0,0,9,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,17,0,
%T A118112 0,0,19,0,0,0,21,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33,0,0,
               0,
%U A118112 35,0,0,0,37,0,0,0,0,0,0,0,41,0,0,0,43,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A118112 Residue of C[3n,n] modulo (n+1).
%C A118112 These divisibilities are analogous to those of Catalan numbers. For rather 
               long sequences of consecutive integers, a(n)=0. For the first 10000 
               integers 9678 residues equals zero. See A118113.
%F A118112 a(n)=Mod(C(3n,n),n+1).
%e A118112 n=9, C[27,7]=4686825, Mod[4686825,10]=5
%t A118112 Table[Binomial[3*k,k],{k,1,10000}]
%Y A118112 Cf. A000108, A118113.
%Y A118112 Sequence in context: A151671 A122480 A096133 this_sequence A081805 A084681 
               A096528
%Y A118112 Adjacent sequences: A118109 A118110 A118111 this_sequence A118113 A118114 
               A118115
%K A118112 nonn
%O A118112 1,5
%A A118112 Labos E. (labos(AT)ana1.sote.hu), Apr 13 2006

Search completed in 0.001 seconds