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”).
%I #13 Mar 28 2018 21:59:40
%S 1,2,4,7,12,19,30,45,68,99,146,215,309,451,659,942,1369,1994,2844,
%T 4126,6002,8553,12400,18029,25683,37225,54113,77076,111703,162368,
%U 231258,335140,487136,693807,1005454,1461443,2081457,3016399
%N a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1.
%H Robert Israel, <a href="/A008609/b008609.txt">Table of n, a(n) for n = 0..6277</a>
%F G.f.: (1+x^2-2*x^3+2*x^4-x^5+x^6-2*x^7+2*x^8-4*x^9+4*x^10-2*x^11+x^12)/(1-3*x^3)/(1-x)^2. - _Vladeta Jovovic_, Mar 23 2003
%F a(n+3) = 3*a(n) + n + 3 for n >= 8. - _Robert Israel_, Mar 28 2018
%p f:= gfun:-rectoproc({a(n+3)=3*a(n)+n+3, seq(a(i)=[1, 2, 4, 7, 12, 19, 30, 45, 68, 99, 146][i+1],i=0..10)}, a(n), remember):
%p map(f, [$0..50]); # _Robert Israel_, Mar 28 2018
%Y Cf. A000792.
%K easy,nonn
%O 0,2
%A Mark Herbster (mark(AT)cse.ucsc.edu)