|
|
A282615
|
|
Number of self-conjugate separable solutions of X + Y = 2Z (integer, disjoint triples from {1,2,3,...,3n}).
|
|
10
|
|
|
0, 1, 1, 3, 4, 9, 20, 35, 102, 160, 736, 930, 5972, 6766, 59017, 61814, 671651
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
An inseparable solution is one in which "there is no j such that the first j of the triples are a partition of 1, ..., 3j" (see A202705).
A self-conjugate solution is one in which for every triple (a, b, c) in the partition there exists a "conjugate" triple (m-a, m-b, m-c) or (m-b, m-a, m-c) where m = 3n+1.
| separable | inseparable | either |
-------------------+-----------+-------------+---------+
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 4 the a(4) = 3 solutions are:
(10,12,11),(7,9,8),(4,6,5),(1,3,2),
(10,12,11),(5,9,7),(4,8,6),(1,3,2), and
(8,12,10),(7,11,9),(2,6,4),(1,5,3).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|