reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Table[a[n], {n, 1, 100}] (* Jean-François Alcover, May 18 2018, after Alois P. Heinz *) *)
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
(Python)
from sympy.solvers.diophantine.diophantine import diop_DN
def A133388(n): return max((a for a, b in diop_DN(-1, n)), default=0) # Chai Wah Wu, Sep 08 2022
approved
editing
editing
approved
(PARI) sum2sqr(n)={ if(n>1, my(L=List(), f, p=1); for(i=1, matsize(f=factor(n))[1], if(f[i, 1]%4==1, listput(L, [qfbsolve(Qfb(1, 0, 1), f[i, 1])*[1, I]~, f[i, 2]] ), /*elseif*/ f[i, 1]==2, p = (1+I)^f[i, 2], /*elseif*/ bittest(f[i, 2], 0), return([]), /*else*/ p *= f[i, 1]^(f[i, 2]\2))); L=apply(s->vector(s[2]+1, j, s[1]^(s[2]+1-j)*conj(s[1])^(j-1)), L); my(S=List()); forvec(T=vector(#L, i, [1, #L[i]]), listput(S, prod( j=1, #T, L[j][T[j]] ))); Set(apply(f->vecsort(abs([real(f), imag(f)])), Set(S)*p)), if(n<0, [], [[0, n]]))} \\ updated by M. F. Hasler, May 12 2018 \\ NOTE: for . (If PARI version >= 2.12.0, x returns an error, append [1] to qfbsolve(...) above which now returns a vector of results! . - M. F. Hasler, Dec 12 2019)
approved
editing