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

%I A001288 M4850 N2073
%S A001288 1,12,78,364,1365,4368,12376,31824,75582,167960,352716,705432,1352078,
               2496144,
%T A001288 4457400,7726160,13037895,21474180,34597290,54627300,84672315,129024480,
%U A001288 193536720,286097760,417225900,600805296,854992152,1203322288,1676056044
%N A001288 Binomial coefficients C(n,11).
%C A001288 a(n) = -A110555(n+1,11). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Jul 27 2005
%C A001288 Product of 11 consecutive numbers divided by 11! - Artur Jasinski (grafix(AT)csl.pl), 
               Dec 02 2007
%C A001288 In this sequence there are no primes - Artur Jasinski (grafix(AT)csl.pl), 
               Dec 02 2007
%C A001288 With a different offset, number of n-permutations (n>=11) of 2 objects: 
               u,v, with repetition allowed, containing exactly (11) u's. Example: 
               n=11, a(0)=1 because we have uuuuuuuuuuu n=12, a(1)=12 because we 
               have uuuuuuuuuuuv, uuuuuuuuuuvu, uuuuuuuuuvuu, uuuuuuuuvuuu, uuuuuuuvuuuu, 
               uuuuuuvuuuuu, uuuuuvuuuuuu, uuuuvuuuuuuu, uuuvuuuuuuuu, uuvuuuuuuuuu 
               uvuuuuuuuuuu, vuuuuuuuuuuu. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Aug 06 2008]
%D A001288 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001288 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001288 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, 
               National Bureau of Standards Applied Math. Series 55, 1964 (and various 
               reprintings), p. 828.
%D A001288 L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 
               256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see 
               vol. 2, p. 7.
%D A001288 J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society 
               Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954.
%D A001288 A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, 
               p. 196.
%H A001288 T. D. Noe, <a href="b001288.txt">Table of n, a(n) for n=11..1000</a>
%H A001288 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.nrbook.com/
               abramowitz_and_stegun/">Handbook of Mathematical Functions</a>, National 
               Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 
               [alternative scanned copy].
%H A001288 P. J. Cameron, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">
               Sequences realized by oligomorphic permutation groups</a>, J. Integ. 
               Seqs. Vol. 3 (2000), #00.1.5.
%H A001288 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=261">
               Encyclopedia of Combinatorial Structures 261</a>
%H A001288 Milan Janjic, <a href="http://www.pmfbl.org/janjic/">Two Enumerative 
               Functions</a>
%F A001288 a(n+10)=n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)/11! - Artur 
               Jasinski (grafix(AT)csl.pl), Dec 02 2007, R. J. Mathar, Jul 07 2009
%F A001288 G.f.: x^11/(1-x)^12. a(n) = C(n,11). [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Aug 06 2008, R. J. Mathar, Jul 07 2009]
%p A001288 seq(binomial(n,11),n=0..30); [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Aug 06 2008, R. J. Mathar, Jul 07 2009]
%t A001288 Table[n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)/11!,{n,1,100}] 
               - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007
%Y A001288 Sequence in context: A139612 A008504 A008494 this_sequence A121665 A124863 
               A022577
%Y A001288 Adjacent sequences: A001285 A001286 A001287 this_sequence A001289 A001290 
               A001291
%K A001288 nonn
%O A001288 11,2
%A A001288 N. J. A. Sloane (njas(AT)research.att.com).
%E A001288 Some formulas for other offsets corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Jul 07 2009

Search completed in 0.001 seconds