|
Search: id:A070745
|
|
|
| A070745 |
|
z such that the Diophantine equation x^2+y^3=z^2 has solutions. |
|
+0
1
|
|
| 3, 6, 10, 14, 15, 17, 21, 24, 28, 29, 35, 36, 42, 43, 45, 48, 55, 57, 60, 62, 63, 66, 76, 78, 80, 81, 90, 91, 99, 105, 112, 118, 119, 120, 123, 127, 129, 132, 136, 140, 141, 143, 147, 153, 154, 155, 161, 162, 165, 168, 171, 172, 179, 185, 190, 192, 195, 209, 210
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
42 is in the sequence because 6^2+12^3=42^2.
|
|
PROGRAM
|
(PARI) for(n=0, 350, if(sum(i=1, n, sum(j=1, n, if(i^2+j^3-n^2, 0, 1)))>0, print1(n, ", ")))
|
|
CROSSREFS
|
Sequence in context: A083505 A099588 A099531 this_sequence A134535 A078060 A022764
Adjacent sequences: A070742 A070743 A070744 this_sequence A070746 A070747 A070748
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 14 2002
|
|
EXTENSIONS
|
Corrected and edited by John W. Layman (layman(AT)math.vt.edu), May 21 2002
|
|
|
Search completed in 0.002 seconds
|
