login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172028 a(1) = 2; for n > 1, a(n) = smallest k such that a(n-1)^3+k is a cube. 3
2, 19, 1141, 3909067, 45842426158669, 6304584108339196948770030691, 119243342337369441148530917575983600568317619049555904517 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(8) has 113 decimal digits.

From a(2) onward a subsequence of A003215 (centered hexagonal numbers: 3n(n+1)+1, also first differences of A000578). - Klaus Brockhaus, Mar 20 2010

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..11

Index entries for sequences of form a(n+1)=a(n)^2 + ...

FORMULA

a(n) = 1 + 3*a(n-1)*(a(n-1) + 1). - R. J. Mathar, Jan 25 2010

a(n) ~ k^(2^n) * 3^n with k = 2.7658.... - Charles R Greathouse IV, Dec 29 2011

The constant k = 2.765824704990104629134798316783956... . - Vaclav Kotesovec, Jan 19 2015

EXAMPLE

n = 2: for k = 19, a(1)^3+k = 2^3+19 = 27 = 3^3 is a cube; 19 is the smallest such k, therefore a(2) = 19.

n = 4: for k = 3909067, a(3)^3+k = 1141^3+3909067 = 1489355288 = 1142^3 is a cube; 3909067 is the smallest such k, therefore a(4) = 3909067.

MAPLE

A172028 := proc(n) option remember; if n <=2 then op(n, [2, 19]) : else 1+3*procname(n-1)*(procname(n-1)+1); end if; end: seq(A172028(n), n=1..8) ; # R. J. Mathar, Jan 25 2010

MATHEMATICA

Join[{a = 2}, Table[a = (a + 1)^3 - a^3, {n, 8}]] (* Vladimir Joseph Stephan Orlovsky, Feb 24 2012 *)

RecurrenceTable[{a[n]==1+3*a[n-1]*(1+a[n-1]), a[1]==2}, a, {n, 1, 10}] (* Vaclav Kotesovec, Jan 19 2015 *)

PROG

(MAGMA) /* inefficient, uses definition */ a:=2; S:=[a]; for n in [2..4] do k:=0; flag:= true; while flag do k+:=1; if IsPower(a^3+k, 3) then Append(~S, k); a:=k; flag:=false; end if; end while; end for; S;

/* uses formula from R. J. Mathar */ [ n eq 1 select 2 else 1+3*Self(n-1)*(Self(n-1)+1): n in [1..8] ]; // Klaus Brockhaus, Mar 16 2010

CROSSREFS

Cf. A172027.

Sequence in context: A012956 A012976 A013107 * A024229 A094663 A274762

Adjacent sequences:  A172025 A172026 A172027 * A172029 A172030 A172031

KEYWORD

nonn

AUTHOR

Vincenzo Librandi, Jan 23 2010

EXTENSIONS

Edited, a(4), a(5), a(6) corrected, a(7) added by Klaus Brockhaus, Mar 16 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 14:03 EST 2020. Contains 338767 sequences. (Running on oeis4.)