Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084379
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A084379
%S A084379 18,25,44,81,142,233,360,529,746,1017,1348,1745,2214,2761,3392,4113,
%T A084379 4930,5849,6876,8017,9278,10665,12184,13841,15642,17593,19700,21969,
%U A084379 24406,27017,29808,32785,35954,39321,42892,46673,50670,54889,59336
%N A084379 a(n) = n^3 + 17.
%H A084379 Cino Hilliard, <a href="http://groups.msn.com/BC2LCC/n37ltk2.msnw">Proof 
               that n^3+7 <> k^2 for all integers n,k</a>.
%o A084379 (PARI) n3pm(n,m) = { for(x=1,n,y=x^3+m; print1(y" ")) }
%Y A084379 Cf. sequence for n^3+17.
%Y A084379 Sequence in context: A166471 A072422 A003300 this_sequence A109769 A093018 
               A167336
%Y A084379 Adjacent sequences: A084376 A084377 A084378 this_sequence A084380 A084381 
               A084382
%K A084379 easy,nonn
%O A084379 0,1
%A A084379 Cino Hilliard (hillcino368(AT)gmail.com), Jun 23 2003

    
page 1

Search completed in 0.001 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research