Search: id:A001287 Results 1-1 of 1 results found. %I A001287 M4794 N2046 %S A001287 1,11,66,286,1001,3003,8008,19448,43758,92378,184756,352716,646646, %T A001287 1144066,1961256,3268760,5311735,8436285,13123110,20030010,30045015 %N A001287 Binomial coefficients C(n,10). %C A001287 a(n) = A110555(n+1,10). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 27 2005 %C A001287 Product of 10 consecutive numbers divided by 10! - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007 %C A001287 In this sequence only 11 is prime - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007 %C A001287 With a different offset, number of n-permutations (n>=10) of 2 objects: u,v, with repetition allowed, containing exactly (10) u's. Example: a(1)=11 because we have uuuuuuuuuuv, uuuuuuuuuvu, uuuuuuuuvuu, uuuuuuuvuuu, uuuuuuvuuuu, uuuuuvuuuuu, uuuuvuuuuuu, uuuvuuuuuuu, uuvuuuuuuuu, uvuuuuuuuuu and vuuuuuuuuuu. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 06 2008] %C A001287 With a different offset, number of n-permutations (n>=10) of 2 objects: u,v, with repetition allowed, containing exactly 10 u's. Example: a(1)=11 because we have uuuuuuuuuuv, uuuuuuuuuvu, uuuuuuuuvuu, uuuuuuuvuuu, uuuuuuvuuuu, uuuuuvuuuuu, uuuuvuuuuuu, uuuvuuuuuuu, uuvuuuuuuuu, uvuuuuuuuuu and vuuuuuuuuuu. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 03 2008 %D A001287 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A001287 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001287 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 A001287 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 A001287 J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954. %D A001287 A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 196. %H A001287 T. D. Noe, Table of n, a(n) for n=10..1000 %H A001287 Milan Janjic, Two Enumerative Functions %H A001287 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. %H A001287 P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5. %H A001287 INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 260 %F A001287 a(n+9)=n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)/10! - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007, R. J. Mathar, Jul 07 2009 %F A001287 G.f.: x^10/(1-x)^11. C(n,10). [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 06 2008, R. J. Mathar, Jul 07 2009] %p A001287 seq(binomial(n,10),n=0..31); [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 06 2008] %t A001287 Table[n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)/10!,{n,1,100}] - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007 %Y A001287 Sequence in context: A162628 A008503 A008493 this_sequence A022576 A000460 A030115 %Y A001287 Adjacent sequences: A001284 A001285 A001286 this_sequence A001288 A001289 A001290 %K A001287 nonn,easy %O A001287 10,2 %A A001287 N. J. A. Sloane (njas(AT)research.att.com). %E A001287 Formulas valid for different offsets rewritten by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 07 2009 Search completed in 0.002 seconds