|
Search: id:A096295
|
|
|
| A096295 |
|
a[n] = a[n-1]+3*(a[n-1]-Floor[a[n-1]^(1/3)]^3). |
|
+0
1
|
|
| 2, 5, 17, 44, 95, 188, 377, 479, 887, 1361, 1451, 1811, 2060, 3056, 3992, 5843, 5876, 6008, 6536, 8648, 10592, 14585, 16868, 20597, 23339, 27500, 29000, 35000, 41696, 48872, 55520, 57464, 65240, 68960, 69077, 69545, 71417, 78905, 93356, 100049
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A cubic version of the Weintraub recursion.
|
|
REFERENCES
|
Steven H. Weintraub, Amer. Math. Monthly, v 111, no. 6, 2004, page 528.
|
|
MATHEMATICA
|
digits=200 r=3 A=Mod[2, r] a[n_Integer?Positive] :=a[n] =a[n-1]+r*(a[n-1]-Floor[a[n-1]^(1/3)]^3) a[1] = A a0=Table[a[n], {n, 1, digits}]
|
|
CROSSREFS
|
Sequence in context: A136194 A056304 A063106 this_sequence A074494 A051438 A148401
Adjacent sequences: A096292 A096293 A096294 this_sequence A096296 A096297 A096298
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 20 2004
|
|
|
Search completed in 0.002 seconds
|
