login

Revision History for A211276

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [1, 2].
(history; published version)
#12 by N. J. A. Sloane at Fri Mar 03 19:45:32 EST 2017
STATUS

editing

approved

#11 by N. J. A. Sloane at Fri Mar 03 19:45:28 EST 2017
NAME

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

STATUS

approved

editing

#10 by Charles R Greathouse IV at Mon Oct 20 17:15:14 EDT 2014
LINKS

Shalosh B. Ekhad and Doron Zeilberger, <a href="http://arxiv.org/abs/1112.6207">Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type</a>, Arxiv arXiv preprint arXiv:1112.6207, 2011. See subpages for rigorous derivations of g.f., recurrence, asymptotics for this sequence.

Discussion
Mon Oct 20
17:15
OEIS Server: https://oeis.org/edit/global/2342
#9 by R. J. Mathar at Sat May 31 17:12:41 EDT 2014
STATUS

editing

approved

#8 by R. J. Mathar at Sat May 31 17:12:37 EDT 2014
FORMULA

Conjecture: n*a(n) +2*(-3*n+1)*a(n-1) +(7*n+6)*a(n-2) +2*(7*n-37)*a(n-3) +3*(-7*n+40)*a(n-4) +6*(-n-4)*a(n-5) +27*(-n+6)*a(n-6) +54*(n-6)*a(n-7)=0. - R. J. Mathar, May 31 2014

#7 by R. J. Mathar at Sat May 31 17:09:14 EDT 2014
FORMULA

n*a(n) +2*(-3*n+1)*a(n-1) +(7*n+6)*a(n-2) +2*(7*n-37)*a(n-3) +3*(-7*n+40)*a(n-4) +6*(-n-4)*a(n-5) +27*(-n+6)*a(n-6) +54*(n-6)*a(n-7)=0. - R. J. Mathar, May 31 2014

STATUS

approved

editing

#6 by R. J. Mathar at Sat Nov 09 14:17:50 EST 2013
STATUS

editing

approved

#5 by R. J. Mathar at Sat Nov 09 14:17:42 EST 2013
REFERENCES

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.

LINKS

Shalosh B. Ekhad and Doron Zeilberger, <a href="http://arxiv.org/abs/1112.6207">Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type</a>, Arxiv preprint arXiv:1112.6207, 2011. See subpages for rigorous derivations of g.f., recurrence, asymptotics for this sequence.

STATUS

approved

editing

#4 by N. J. A. Sloane at Sat Apr 07 14:39:39 EDT 2012
STATUS

editing

approved

#3 by N. J. A. Sloane at Sat Apr 07 14:39:36 EDT 2012
NAME

allocated for N. J. A. Sloane

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

DATA

1, 3, 7, 18, 47, 123, 328, 886, 2419, 6675, 18587, 52164, 147404, 418991, 1197002, 3434568, 9891715, 28580469, 82808899, 240511642, 700024987, 2041255981, 5962023006, 17439034426, 51075928264, 149767494573, 439619556301, 1291671623988, 3798447661874, 11179106282223, 32925086562548

OFFSET

0,2

REFERENCES

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.

KEYWORD

allocated

nonn

AUTHOR

N. J. A. Sloane, Apr 07 2012

STATUS

approved

editing