Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084377
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084377 n^3 + 7. +0
1
7, 8, 15, 34, 71, 132, 223, 350, 519, 736, 1007, 1338, 1735, 2204, 2751, 3382, 4103, 4920, 5839, 6866, 8007, 9268, 10655, 12174, 13831, 15632, 17583, 19690, 21959, 24396, 27007, 29798, 32775, 35944, 39311, 42882, 46663, 50660, 54879, 59326 (list; graph; listen)
OFFSET

0,1

COMMENT

These numbers cannot be perfect squares. See Hilliard link for a proof. - Cino Hilliard (hillcino368(AT)gmail.com), Sep 03 2006

LINKS

Cino Hilliard, Proof that n^3+7 != k^2 for all integers n,k.

PROGRAM

(PARI) g(n) = for(x=0, n, print1(x^3+7", ")) - Cino Hilliard (hillcino368(AT)gmail.com), Sep 03 2006

CROSSREFS

Sequence in context: A042001 A020690 A066971 this_sequence A041675 A041098 A041427

Adjacent sequences: A084374 A084375 A084376 this_sequence A084378 A084379 A084380

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Jun 23 2003

EXTENSIONS

More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 29 2006

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research