|
Search: id:A010330
|
|
|
| A010330 |
|
n such C(n,3) = C(x,3) + C(y,3) is solvable. |
|
+0
2
|
|
| 6, 17, 57, 60, 76, 111, 112, 121, 142, 177, 247, 296, 420, 437, 454, 476, 494, 530, 537, 552, 564, 590, 646, 690, 704, 716, 742, 749, 755, 820, 870, 910, 920, 1100, 1160, 1222, 1243, 1430, 1436, 1446, 1452, 1647, 1710, 1740, 1788, 1870, 2172, 2185, 2222, 2258
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Bombieri's Napkin Problem: Bombieri said that "the equation C(x,n)+C(y,n)=C(z,n) has no trivial solutions for n >= 3" (the joke being that he said "trivial" rather than "nontrivial"!).
|
|
REFERENCES
|
J. Leech, Some solutions of Diophantine equations, Proc. Camb. Phil. Soc., 53 (1957), 778-780.
Van der Poorten, Notes on Fermat's Last Theorem, Wiley, p. 122.
|
|
EXAMPLE
|
C(10,3)+C(16,3)=C(17,3)=680.
|
|
CROSSREFS
|
Cf. A034404.
Adjacent sequences: A010327 A010328 A010329 this_sequence A010331 A010332 A010333
Sequence in context: A128525 A083334 A088016 this_sequence A109311 A006758 A123189
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
