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.

A051257 Numbers formed from binomial coefficients (mod 2+k) interpreted as digits in factorial base.

This page as a plain text file.
%I A051257 #13 May 01 2014 02:49:07
%S A051257 1,3,11,43,231,1337,9739,76209,706109,6914977,78150249,920172983,
%T A051257 12216376453,168531536319,2571960399839,40581616143967,
%U A051257 701349512411763,12460393480873445,240094506439569631,4749510978132662277
%N A051257 Numbers formed from binomial coefficients (mod 2+k) interpreted as digits in factorial base.
%H A051257 Vincenzo Librandi, <a href="/A051257/b051257.txt">Table of n, a(n) for n = 0..200</a>
%F A051257 a(n) = Sum (k+1)!(C(n, k) mod (2+k)), k=0..n
%e A051257 a(5) = (1 mod 2)1!+(5 mod 3)2!+(10 mod 4)3!+(10 mod 5)4!+(5 mod 6)5!+(1 mod 7)6! = 1*1+2*2+2*6+0*24+5*120+1*720 = 1337
%p A051257 a(n) := proc(n) local i; RETURN(add(((binomial(n,i)mod(i+2))*((i+1)!)),i=0..n)); end;
%t A051257 a[n_] := Sum[(k+1)!*Mod[Binomial[n, k], 2+k], {k, 0, n}]; Table[a[n], {n, 0, 19}] (* _Jean-François Alcover_, Sep 09 2013 *)
%Y A051257 Cf. A001317, A001339, A048757, A047999, A051256.
%K A051257 nonn,nice,base
%O A051257 0,2
%A A051257 _Antti Karttunen_, Oct 24 1999