OFFSET
1,3
COMMENTS
It appears that there are no modular constraints on this sequence; i.e., every residue class of every integer has representatives here. - Franklin T. Adams-Watters, Dec 03 2009
A045634(a(n)) > 0. - Reinhard Zumkeller, Jul 17 2010
LINKS
R. Zumkeller, Table of n, a(n) for n = 1..10000 - Reinhard Zumkeller, Jul 17 2010
MATHEMATICA
q=30; imax=q^2; Select[Union[Flatten[Table[x^2+y^3, {y, 0, q^(2/3)}, {x, 0, q}]]], #<=imax&] (* Vladimir Joseph Stephan Orlovsky, Apr 20 2011 *)
PROG
(PARI) is(n)=for(k=0, sqrtnint(n, 3), if(issquare(n-k^3), return(1))); 0 \\ Charles R Greathouse IV, Aug 24 2020
(PARI) list(lim)=my(v=List(), t); for(k=0, sqrtnint(lim\=1, 3), t=k^3; for(n=0, sqrtint(lim-t), listput(v, t+n^2))); Set(v) \\ Charles R Greathouse IV, Aug 24 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved