Number of positive solutions of the Diophantine x*p+y*q=(p+q)^3,

[franktaw at netscape.net]

The reference to primes seems arbitrary.  I would be more
interested in a table, with T(n,k) = number of positive
solutions to x*n + y*k = (n+k)^3, for n >= k >= 1.

(I'm still not terribly interested, but I do think it's probably
worthy of inclusion in the OEIS.  Keyword "nice" -- no.)

Franklin T. Adams-Watters

-----Original Message-----
From: zak seidov <zakseidov at yahoo.com>

Dear seqfans, is it new/correct/interesting/nice, or
old/wrong/dumb?
thanks, zak

...
%N A000001 Number of positive solutions of the
Diophantine x*p+y*q=(p+q)^3, p=n-th prime, q=(n+1)-th
prime.
...
________________________________________________________________________
More new features than ever.  Check out the new AIM(R) Mail ! - 
http://webmail.aim.com