login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084379 a(n) = n^3 + 17. 1

%I #18 Sep 08 2022 08:45:11

%S 17,18,25,44,81,142,233,360,529,746,1017,1348,1745,2214,2761,3392,

%T 4113,4930,5849,6876,8017,9278,10665,12184,13841,15642,17593,19700,

%U 21969,24406,27017,29808,32785,35954,39321,42892,46673,50670,54889,59336

%N a(n) = n^3 + 17.

%H Vincenzo Librandi, <a href="/A084379/b084379.txt">Table of n, a(n) for n = 0..1000</a>

%H Cino Hilliard, <a href="https://web.archive.org/web/20080621104333/http://groups.msn.com:80/BC2LCC/n37ltk2.msnw">Proof that a cube plus 7 cannot be a square</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F G.f.: (17 - 50*x + 55*x^2 - 16*x^3)/(1 - x)^4. - _Vincenzo Librandi_, Jun 11 2016

%t Table[n^3 + 17, {n, 0, 60}] (* _Vincenzo Librandi_, Jun 11 2016 *)

%t LinearRecurrence[{4,-6,4,-1},{17,18,25,44},40] (* _Harvey P. Dale_, Jul 03 2017 *)

%o (PARI) n3pm(n,m) = { for(x=1,n,y=x^3+m; print1(y", ")) }

%o (Magma) [n^3+17: n in [0..50]]; // _Vincenzo Librandi_, Jun 11 2016

%Y Cf. sequence for n^3+17.

%K easy,nonn

%O 0,1

%A _Cino Hilliard_, Jun 23 2003

%E a(0) = 17 by _Vincenzo Librandi_, Jun 11 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)