|
| |
|
|
A071006
|
|
Number of positive solutions to the Diophantine equation x^2+y^3=n^2.
|
|
0
| |
|
|
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 1, 0, 1, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,55
|
|
|
PROG
| (PARI) for(n=1, 100, print1(sum(i=1, n, sum(j=1, i, if(i^2+j^3-n^2, 0, 1))), ", "))
|
|
|
CROSSREFS
| Sequence in context: A191250 A107064 A113687 * A178781 A080843 A087371
Adjacent sequences: A071003 A071004 A071005 * A071007 A071008 A071009
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 18 2002
|
| |
|
|
