Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020329
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020329 Consider integers z such C(z,4) = C(x,4) + C(y,4), x >= y, is solvable. Sequence gives values of z. +0
2
8, 200 (list; graph; listen)
OFFSET

1,1

REFERENCES

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

A. 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. Harborth, Fermat-like binomial equations, Applications of Fibonacci numbers, Proc. 2nd Int. Conf., San Jose/Ca., August 1986, 1-5 (1988).

J. Leech, Some solutions of Diophantine equations, Proc. Camb. Phil. Soc., 53 (1957), 778-780.

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

CROSSREFS

Cf. A010332.

Sequence in context: A103500 A119299 A024287 this_sequence A034861 A063856 A090962

Adjacent sequences: A020326 A020327 A020328 this_sequence A020330 A020331 A020332

KEYWORD

nonn,bref

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

a(3)>126900 - Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), May 02 2000

Additional references from Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 09 2000

page 1

Search completed in 0.192 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research