%I A118465
%S A118465 0,9,66,219,516,1005,1734,2751,4104,5841,8010,10659,13836,17589,21966,
%T A118465 27015,32784,39321,46674,54891,64020,74109,85206,97359,110616,125025,
%U A118465 140634,157491,175644,195141,216030,238359,262176,287529,314466,343035
%N A118465 a(n) = 8*n^3 + n.
%C A118465 (8*n^3 + n, 8*n^3 - n) solves the Diophantine equation 2*(X-Y)^3-(X+Y)=0.
%C A118465 (m*(2n)^k+n, m*(2n)^k-n) solves the Diophantine equation: 2m*(X-Y)^k-(X+Y)=0 
               with X>=Y,k>=2 and where m is a natural integer. Also ((m*n^k+n)/
               2, (m*n^k-n)/2) solves the Diophantine equation: m*(X-Y)^k-(X+Y)=0 
               with X>=Y,k>=2 where m is an odd number
%F A118465 G.f.: 3*x*(x+3)*(3*x+1)/(-1+x)^4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 14 2007
%t A118465 Table[8*n^3 + n, {n, 0, 35}]
%Y A118465 Cf. A006003.
%Y A118465 Sequence in context: A120286 A152581 A122733 this_sequence A051375 A081902 
               A002695
%Y A118465 Adjacent sequences: A118462 A118463 A118464 this_sequence A118466 A118467 
               A118468
%K A118465 nonn
%O A118465 0,2
%A A118465 Mohamed Bouhamida (bhmd95(AT)yahoo.fr), May 16 2006, Oct 02 2007
%E A118465 Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 
               24 2007