|
|
A172028
|
|
a(1) = 2; for n > 1, a(n) = smallest k such that a(n-1)^3+k is a cube.
|
|
3
|
|
|
|
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
|
|
|
FORMULA
|
a(n) = 1 + 3*a(n-1)*(a(n-1) + 1). - R. J. Mathar, Jan 25 2010
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
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Edited, a(4), a(5), a(6) corrected, a(7) added by Klaus Brockhaus, Mar 16 2010
|
|
STATUS
|
approved
|
|
|
|