login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = 2*a(n-1) - a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.
2

%I #4 Feb 11 2018 10:54:53

%S 1,1,1,2,4,7,12,19,30,45,67,96,137,190,262,353,474,625,821,1062,1370,

%T 1745,2216,2783,3487,4328,5359,6580,8063,9808,11906,14357,17282,20681,

%U 24705,29354,34824,41115,48468,56883,66668,77823,90723,105368,122229,141306

%N a(n) = 2*a(n-1) - a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.

%H Clark Kimberling, <a href="/A298414/b298414.txt">Table of n, a(n) for n = 0..1000</a>

%t a[0] = 1; a[1] = 1; a[2] = 1;

%t a[n_] := a[n] = 2 a[n - 1] - a[n - 2] + a[Floor[n/2]];

%t Table[a[n], {n, 0, 30}] (* A298414 *)

%Y Cf. A298338.

%K nonn,easy

%O 0,4

%A _Clark Kimberling_, Feb 11 2018