This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217716 Product_{k=0..n} (binomial(n,k) + 1). 4
 2, 4, 12, 64, 700, 17424, 1053696, 160579584, 62856336636, 63812936890000, 168895157342195152, 1169048914836855865344, 21209591746609937928524800, 1010490883477487017627972550656, 126641164340871500483202065902080000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Number of words less than or equal to the concatenation of the n-th row of Pascal's Triangle. a(n) = 2 * A055612(n). - Reinhard Zumkeller, Jan 31 2015 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..69 EXAMPLE Row 2 is 1 2 1 and we have 000, 001, 010, 011, 020, 021, 100, 101, 110, 111, 120 and 121 so a(2)=12. MATHEMATICA Table[Product[Binomial[n, k] + 1, {k, 0, n}], {n, 0, 15}] (* T. D. Noe, Mar 21 2013 *) PROG (JavaScript) function factorial(n) { var i, c=1; for (i=2; i<=n; i++) c*=i; return c; } function binomial(n, k) { return factorial(n)/(factorial(k)*factorial(n-k)); } for (i=1; i<20; i++) { c=4; for (j=1; j

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 17 20:06 EST 2018. Contains 299296 sequences. (Running on oeis4.)