Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118465 a(n) = 8*n^3 + n. +0
2
0, 9, 66, 219, 516, 1005, 1734, 2751, 4104, 5841, 8010, 10659, 13836, 17589, 21966, 27015, 32784, 39321, 46674, 54891, 64020, 74109, 85206, 97359, 110616, 125025, 140634, 157491, 175644, 195141, 216030, 238359, 262176, 287529, 314466, 343035 (list; graph; listen)
OFFSET

0,2

COMMENT

(8*n^3 + n, 8*n^3 - n) solves the Diophantine equation 2*(X-Y)^3-(X+Y)=0.

(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

FORMULA

G.f.: 3*x*(x+3)*(3*x+1)/(-1+x)^4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 14 2007

MATHEMATICA

Table[8*n^3 + n, {n, 0, 35}]

CROSSREFS

Cf. A006003.

Sequence in context: A100311 A120286 A122733 this_sequence A051375 A081902 A002695

Adjacent sequences: A118462 A118463 A118464 this_sequence A118466 A118467 A118468

KEYWORD

nonn

AUTHOR

Mohamed Bouhamida (bhmd95(AT)yahoo.fr), May 16 2006, Oct 02 2007

EXTENSIONS

Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 24 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research