Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

REFERENCES

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

CROSSREFS

Cf. A020329.

Sequence in context: A059382 A012843 A012798 this_sequence A024096 A030257 A012849

Adjacent sequences: A010329 A010330 A010331 this_sequence A010333 A010334 A010335

KEYWORD

nonn,bref

AUTHOR

njas

page 1

Search completed in 0.002 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 July 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research