OFFSET
1,3
COMMENTS
a(4)=10 for example is the number of ways of arranging 1 a, 2 b's, 3 c's and 4 d's so that if we look at any two letters, i and j say, with i<j, then any pair of i's are separated and surrounded by at least one j.
If the condition is imposed only on pairs of consecutive letters, we get A003121.
REFERENCES
C. L. Mallows, Letter to N. J. A. Sloane, Nov 11 1980
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Georg Fischer, Perl program
EXAMPLE
The 10 sequences for n=4 are dcbadcbdcd dcbadcdbcd dcbdacbdcd dcbdacdbcd dcbdcabdcd dcbdcadbcd dcbdcdabcd dcdbacdbcd dcdbcadbcd dcdbcdabcd.
For example in dcbdacdbcd we see
..ba...b..
.cb..c.bc.
d.bd..db.d
dc.d.cd.cd
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane. Entry revised and given a new A-number by N. J. A. Sloane, Jun 13 2012. The old entry was A004065.
EXTENSIONS
a(7) from David W. Wilson, Dec 11 1999
Definition clarified by David Applegate, Jun 14 2012
a(8) from Georg Fischer, Mar 21 2018
STATUS
approved