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!)
A096297 a(1) = 3, a(n) = a(n-1) + 4*(a(n-1)-floor(a(n-1)^(1/3))^3). 0
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; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A cubic version of the Weintraub recursion.
LINKS
Steven H. Weintraub, An Interesting Recursion, Amer. Math. Monthly, v 111, no. 6, 2004, page 528.
MATHEMATICA
NestList[#+4(#-Floor[Surd[#, 3]]^3)&, 3, 40] (* Harvey P. Dale, Apr 16 2015 *)
CROSSREFS
Sequence in context: A282198 A158034 A002515 * A081857 A168163 A120088
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Jun 20 2004
EXTENSIONS
Name edited by Michel Marcus, Jun 03 2019
STATUS
approved

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 24 15:42 EDT 2024. Contains 371960 sequences. (Running on oeis4.)