STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A272135
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Numbers of ways of placing the numbers 1, ..., n on a circle (not counting rotations and reflections) such that for each s in {1, ..., n(n+1)/2}, there exists a connected subset S of the circle such that the numbers covered by S add up to s.
(history; published version)
(history; published version)
LINKS
Math Mathematics Stack Exchange, <a href="http://math.stackexchange.com/questions/1603906/">Placing the integers {1,2,...,n} on a circle (for n>1) in some special order</a>
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed
DATA
1, 1, 1, 1, 2, 10, 41, 126, 537, 3956, 19776, 76340, 388047, 2775155, 15013424, 54188455, 272147013
EXTENSIONS
a(16) from Giovanni Resta, Apr 22 2016
STATUS
proposed
editing
STATUS
editing
proposed
LINKS
Math Stack Exchange, <a href="http://math.stackexchange.com/questions/1603906/">Question</a> asked and discussed Placing the integers {1,2,...,n} on Mathematics Stack Exchangea circle (for n>1) in some special order</a>
STATUS
proposed
editing
STATUS
editing
proposed
LINKS
Math Stack Exchange, <a href="http://math.stackexchange.com/questions/1603906/">Question</a> asked and discussed on Mathematics Stack Exchange
KEYWORD
nonn,more,changed
STATUS
proposed
editing