A096295 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A096295

a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).

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; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

A cubic version of the Weintraub recursion.

LINKS

Table of n, a(n) for n=1..40.

Steven H. Weintraub, An Interesting Recursion, Amer. Math. Monthly, v 111, no. 6, 2004, page 528.

MATHEMATICA

digits=200

a[n_Integer?Positive] := a[n] = a[n-1] + 3*(a[n-1] - Floor[a[n-1]^(1/3)]^3)

a[1] = 2