Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084378
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A084378
%S A084378 4,11,30,67,128,219,346,515,732,1003,1334,1731,2200,2747,3378,4099,4916,
%T A084378 5835,6862,8003,9264,10651,12170,13827,15628,17579,19686,21955,24392,
%U A084378 27003,29794,32771,35940,39307,42878,46659,50656,54875,59322,64003
%N A084378 a(n) = n^3 + 3.
%H A084378 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 A084378 (PARI) n3pm(n,m) = { for(x=1,n,y=x^3+m; print1(y" ")) }
%Y A084378 Cf. sequence for n^3+7.
%Y A084378 Sequence in context: A098149 A124861 A110579 this_sequence A099065 A102281 
               A026583
%Y A084378 Adjacent sequences: A084375 A084376 A084377 this_sequence A084379 A084380 
               A084381
%K A084378 easy,nonn
%O A084378 0,1
%A A084378 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research