|
Search: id:A059106
|
|
|
| A059106 |
|
Number of solutions to variant of Langford (or Langford-Skolem) problem. |
|
+0
5
|
|
| 1, 0, 0, 3, 5, 0, 0, 252, 1328, 0, 0, 227968, 1520280, 0, 0, 700078384, 6124491248, 0, 0, 5717789399488, 61782464083584, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
How many ways are of arranging the numbers 1,1,2,2,3,3,...,n,n so that there are zero numbers between the two 1's, one number between the two 2's, ..., n-1 numbers between the two n's?
For n>1, a(n)=A004075(n)/2 because A004075 also counts reflected solutions. - Martin Fuller (martin_n_fuller(AT)btinternet.com), Mar 08 2007
|
|
REFERENCES
|
R. S. Nickerson, A variant of Langford's Problem, American Math. Monthly, 1967, 74, 591-595.
|
|
LINKS
|
J. E. Miller, Langford's Problem
|
|
EXAMPLE
|
For n=4 a solution is 42324311.
|
|
CROSSREFS
|
Cf. A014552, A050998, A059107, A059108.
Cf. A004075.
Sequence in context: A025115 A113037 A063866 this_sequence A087676 A058813 A132701
Adjacent sequences: A059103 A059104 A059105 this_sequence A059107 A059108 A059109
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 14 2001
|
|
EXTENSIONS
|
a(20) - a(23) from Mike Godfrey (m.godfrey(AT)umist.ac.uk), Mar 14 2002
|
|
|
Search completed in 0.002 seconds
|
