|
Search: id:A096297
|
|
|
| A096297 |
|
a[n] = a[n-1]+4*(a[n-1]-Floor[a[n-1]^(1/3)]^3). |
|
+0
1
|
|
| 3, 11, 23, 83, 159, 295, 611, 1007, 1035, 1175, 1875, 2463, 3527, 4135, 4291, 5071, 5703, 8863, 12315, 12907, 15867, 16835, 21675, 29643, 40215, 43859, 47795, 52351, 59143, 76227, 84783, 105887, 114143, 128347, 141735, 146243, 168783, 178415
(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=4 A=Mod[3, 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: A032026 A158034 A002515 this_sequence A081857 A120088 A081737
Adjacent sequences: A096294 A096295 A096296 this_sequence A096298 A096299 A096300
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 20 2004
|
|
|
Search completed in 0.002 seconds
|
