|
|
|
|
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.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Product_{k=0..n} (binomial(n,k) + 1).
|
|
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 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
dead
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|