login
a(0)=0, a(1)=1, for n>1, a(n) = a(n-1)*2 + floor(a(n-2)/n).
0

%I #10 Mar 13 2016 16:23:58

%S 0,1,2,4,8,16,33,68,140,287,588,1202,2453,4998,10171,20675,41985,

%T 85186,172704,349891,708417,1433495,2899190,5860705,11842209,23918846,

%U 48293161,97472205,196669165,396699440,799954518,1612705792,3250410162

%N a(0)=0, a(1)=1, for n>1, a(n) = a(n-1)*2 + floor(a(n-2)/n).

%t RecurrenceTable[{a[0]==0,a[1]==1,a[n]==2*a[n-1]+Floor[a[n-2]/n]}, a, {n,40}] (* _Harvey P. Dale_, Mar 13 2016 *)

%o (Python)

%o prpr = 0

%o prev = 1

%o for n in range(2,99):

%o . current = prev*2 + prpr//n

%o . print prpr,

%o . prpr = prev

%o . prev = current

%K nonn

%O 0,3

%A _Alex Ratushnyak_, Apr 29 2012