cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A298414 #4 Feb 11 2018 10:54:53
%S A298414 1,1,1,2,4,7,12,19,30,45,67,96,137,190,262,353,474,625,821,1062,1370,
%T A298414 1745,2216,2783,3487,4328,5359,6580,8063,9808,11906,14357,17282,20681,
%U A298414 24705,29354,34824,41115,48468,56883,66668,77823,90723,105368,122229,141306
%N A298414 a(n) = 2*a(n-1) - a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.
%H A298414 Clark Kimberling, <a href="/A298414/b298414.txt">Table of n, a(n) for n = 0..1000</a>
%t A298414 a[0] = 1; a[1] = 1; a[2] = 1;
%t A298414 a[n_] := a[n] = 2 a[n - 1] - a[n - 2] + a[Floor[n/2]];
%t A298414 Table[a[n], {n, 0, 30}]  (* A298414 *)
%Y A298414 Cf. A298338.
%K A298414 nonn,easy
%O A298414 0,4
%A A298414 _Clark Kimberling_, Feb 11 2018