A211303 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A211303

a(n) = number of n-lettered words in the alphabet {1, 2, 3, 4} with as many occurrences of the substring (consecutive subword) [1, 1] as of [1, 2].

1, 4, 14, 51, 186, 681, 2507, 9272, 34450, 128569, 481865, 1813294, 6849679, 25967722, 98778134, 376923683, 1442500626, 5535489345, 21295353521, 82114239566, 317305643893, 1228538872416, 4765221729960, 18513858369501, 72039704814391, 280707788515378, 1095205252459856, 4278094293847005

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Shalosh B. Ekhad and Doron Zeilberger, Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type, arXiv preprint arXiv:1112.6207, 2011. See subpages for rigorous derivations of g.f., recurrence, asymptotics for this sequence.

CROSSREFS

Sequence in context: A034743 A096241 A283108 * A247415 A292463 A371870

Adjacent sequences: A211300 A211301 A211302 * A211304 A211305 A211306

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 08 2012

STATUS

approved