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.
%I A362255 #7 Apr 19 2023 02:47:14
%S A362255 1,1,1,4,7,10,16,25,37,55,82,121,178,262,385,565,829,1216,1783,2614,
%T A362255 3832,5617,8233,12067,17686,25921,37990,55678,81601,119593,175273,
%U A362255 256876,376471,551746,808624,1185097,1736845,2545471,3730570,5467417,8012890,11743462,17210881
%N A362255 a(0) = a(1) = a(2) = 1, for n > 2, a(n) = a(n-1) + a(n-k) + k with k = 2.
%C A362255 Called Leonardo 2-numbers in the Tan-Leung paper.
%H A362255 Elif Tan and Ho-Hon Leung, <a href="https://doi.org/10.5281/zenodo.7569221">On Leonardo p-Numbers</a>, Integers (2023) Vol. 23, #A7. See p. 2.
%H A362255 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,-1).
%t A362255 LinearRecurrence[{2, -1, 1, -1}, {1, 1, 1, 4}, 40] (* or *)
%t A362255 With[{k = 2}, Nest[Append[#, #[[-1]] + #[[-k - 1]] + k] &, {1, 1, 1}, 40] ]
%Y A362255 Cf. A001595, A111314, A362256.
%K A362255 nonn,easy
%O A362255 0,4
%A A362255 _Michael De Vlieger_, Apr 13 2023