login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002311 n-th tetrahedral number is the sum of 2 tetrahedral numbers.
(Formerly M3498 N1419)
6

%I M3498 N1419

%S 4,15,55,58,74,109,110,119,140,175,245,294,418,435,452,474,492,528,

%T 535,550,562,588,644,688,702,714,740,747,753,818,868,908,918,1098,

%U 1158,1220,1241,1428,1434,1444,1450,1645,1708,1738,1786,1868,2170,2183,2220,2256

%N n-th tetrahedral number is the sum of 2 tetrahedral numbers.

%C Indices of A034404. [From Harvey P. Dale, Jul 25 2011]

%D Aviezri S. Fraenkel, Diophantine equations involving generalized triangular and tetrahedral numbers, pp. 99-114 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.

%D H. Finner and K. Strassburger, Increasing sample sizes do not necessarily increase the power of UMPU-tests for 2 X 2-tables. Metrika, 54, 77-91, (2001).

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A002311/b002311.txt">Table of n, a(n) for n=1..463</a>

%H M. Wunderlich, <a href="http://dx.doi.org/10.1090/S0025-5718-1962-0148608-X">Certain properties of pyramidal and figurate numbers</a>, Math. Comp., 16 (1962), 482-486.

%t With[{tetras=Binomial[Range[1100]+2,3]},Flatten[Position[tetras,#]&/@ Union[Select[Total/@Tuples[tetras,2],MemberQ[tetras,#]&]]]](* From Harvey P. Dale, Jul 26 2011 *)

%Y Cf. A000292, A034404.

%K nonn,easy,nice

%O 1,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 20 05:41 EDT 2013. Contains 226419 sequences.