editing
approved
editing
approved
<a href="/index/Rec#order_0304">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,-1).
approved
editing
proposed
approved
editing
proposed
allocated a(0) = a(1) = a(2) = 1, for Michael De Vliegern > 2, a(n) = a(n-1) + a(n-k) + k with k = 2.
1, 1, 1, 4, 7, 10, 16, 25, 37, 55, 82, 121, 178, 262, 385, 565, 829, 1216, 1783, 2614, 3832, 5617, 8233, 12067, 17686, 25921, 37990, 55678, 81601, 119593, 175273, 256876, 376471, 551746, 808624, 1185097, 1736845, 2545471, 3730570, 5467417, 8012890, 11743462, 17210881
0,4
Called Leonardo 2-numbers in the Tan-Leung paper.
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.
<a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,-1).
LinearRecurrence[{2, -1, 1, -1}, {1, 1, 1, 4}, 40] (* or *)
With[{k = 2}, Nest[Append[#, #[[-1]] + #[[-k - 1]] + k] &, {1, 1, 1}, 40] ]
allocated
nonn,easy
Michael De Vlieger, Apr 13 2023
approved
editing
allocating
allocated
allocated for Michael De Vlieger
allocating
approved