cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A034404 Values of C(n,3) which can be written as C(x,3) + C(y,3).

This page as a plain text file.
%I A034404 #27 Mar 25 2023 13:22:39
%S A034404 20,680,29260,34220,70300,221815,227920,287980,467180,908600,2481115,
%T A034404 4278680,12259940,13813570,15493204,17861900,19970444,24672560,
%U A034404 25665020,27880600,29742164,34055980,44722580
%N A034404 Values of C(n,3) which can be written as C(x,3) + C(y,3).
%C A034404 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"!).
%C A034404 Also: tetrahedral numbers that are the sum of two other tetrahedral numbers. (For the indices of these terms, see A002311.) - _Harvey P. Dale_, Jul 25 2011
%D A034404 Van der Poorten, Notes on Fermat's Last Theorem, Wiley, p. 122.
%H A034404 Delbert L. Johnson, <a href="/A034404/b034404.txt">Table of n, a(n) for n = 1..672</a>
%F A034404 a(n) = A000292(A002311(n)). - _Reinhard Zumkeller_, May 02 2014
%e A034404 C(10,3) + C(16,3) = C(17,3) = 680.
%t A034404 With[{tetras=Binomial[Range[700]+2,3]},Union[Select[Total/@Tuples[ tetras,2], MemberQ[tetras,#]&]]] (* _Harvey P. Dale_, Jul 25 2011 *)
%o A034404 (Haskell)
%o A034404 a034404 = a000292 . a002311  -- _Reinhard Zumkeller_, May 02 2014
%Y A034404 Cf. A000292, A010330, A002311.
%K A034404 nonn,nice
%O A034404 1,1
%A A034404 _N. J. A. Sloane_
%E A034404 Offset corrected by _Andrew Howroyd_, Mar 23 2023