|
Search: id:A002938
|
|
|
| A002938 |
|
The minimal sequence (from solving n^3 - m^2 = a(n)).
(Formerly M0033 N0008)
|
|
+0
3
|
|
| 0, 1, 2, 0, 4, 9, 18, 17, 0, 24, 35, 36, 12, 40, 11, 0, 13, 56, 30, 79, 45, 39, 67, 100, 0, 113, 83, 48, 53, 104, 138, 7, 163, 100, 26, 0, 28, 116, 217, 9, 248, 104, 17, 80, 79, 8, 139, 297, 0, 316, 155, 17, 119, 145, 89, 55, 293, 252, 170, 225, 405, 184, 47, 0, 49
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(n^2)=0 - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 17 2002
|
|
REFERENCES
|
Marshall Hall, Jr., The diophantine equation x^3-y^2=k, pp. 173-198 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.
|
|
PROGRAM
|
(PARI) a(n)=vecmin(vector(ceil(n^(3/2)), i, abs(n^3-i^2)))
|
|
CROSSREFS
|
a(n) = |A077119(n)|.
Sequence in context: A070015 A021492 A077119 this_sequence A111938 A055978 A069025
Adjacent sequences: A002935 A002936 A002937 this_sequence A002939 A002940 A002941
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 17 2002
|
|
|
Search completed in 0.002 seconds
|
