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
4, 15, 55, 58, 74, 109, 110, 119, 140, 175, 245, 294, 418, 435, 452, 474, 492, 528, 535, 550, 562, 588, 644, 688, 702, 714, 740, 747, 753, 818, 868, 908, 918, 1098, 1158, 1220, 1241, 1428, 1434, 1444, 1450, 1645, 1708, 1738, 1786, 1868, 2170, 2183, 2220, 2256 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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

REFERENCES

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.

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).

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

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

LINKS

T. D. Noe, Table of n, a(n) for n=1..463

M. Wunderlich, Certain properties of pyramidal and figurate numbers, Math. Comp., 16 (1962), 482-486.

MATHEMATICA

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 *)

CROSSREFS

Cf. A000292, A034404.

Sequence in context: A094821 A071723 A001559 * A102349 A126932 A094833

Adjacent sequences:  A002308 A002309 A002310 * A002312 A002313 A002314

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 February 12 18:02 EST 2012. Contains 205432 sequences.