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!)
A084381 a(n) = n^3 + 5. 5

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

%S 5,6,13,32,69,130,221,348,517,734,1005,1336,1733,2202,2749,3380,4101,

%T 4918,5837,6864,8005,9266,10653,12172,13829,15630,17581,19688,21957,

%U 24394,27005,29796,32773,35942,39309,42880,46661,50658,54877,59324,64005

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

%H Vincenzo Librandi, <a href="/A084381/b084381.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.: (5 - 14*x + 19*x^2 - 4*x^3)/(1 - x)^4. - _Vincenzo Librandi_, Jun 09 2016

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3. - _Vincenzo Librandi_, Jun 09 2016

%t Table[n^3 + 5, {n, 0, 60}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 15 2011 *)

%o (PARI) a(n) = n^3 + 5;

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

%Y Cf. A000578, A084378.

%K easy,nonn

%O 0,1

%A _Cino Hilliard_, Jun 23 2003

%E Offset 0 and a(0) = 5 by _Vincenzo Librandi_, Jun 09 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.)