|
|
A362256
|
|
a(0) = a(1) = a(2) = 1, for n > 2, a(n) = a(n-1) + a(n-k) + k with k = 3.
|
|
1
|
|
|
1, 1, 1, 5, 9, 13, 17, 25, 37, 53, 73, 101, 141, 197, 273, 377, 521, 721, 997, 1377, 1901, 2625, 3625, 5005, 6909, 9537, 13165, 18173, 25085, 34625, 47793, 65969, 91057, 125685, 173481, 239453, 330513, 456201, 629685, 869141, 1199657, 1655861, 2285549, 3154693
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
Called Leonardo 3-numbers in the Tan-Leung paper.
|
|
LINKS
|
|
|
MATHEMATICA
|
LinearRecurrence[{2, -1, 0, 1, -1}, {1, 1, 1, 5, 9}, 44] (* or *)
With[{p = 3}, Nest[Append[#, #[[-1]] + #[[-p - 1]] + p] &, {1, 1, 1, 5}, 40] ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|