A345372 a(n) = Sum_{i=1..n} nac(i,n) where nac(i,n) is the n-th i-bonacci number. The n-th i-bonacci number here is equal to 1 for the first i terms, with subsequent terms equaling the sum of the previous n terms.

1, 2, 4, 8, 16, 31, 60, 114, 217, 411, 780, 1481, 2820, 5379, 10288, 19720, 37884, 72924, 140640, 271695, 525698, 1018611, 1976276, 3838889, 7465191, 14531683, 28313776, 55214993, 107762464, 210477611, 411387724, 804609206, 1574671586, 3083549861, 6041628460

Offset

1,2

Comments

a(n) is the sum of the first n elements of the n-th column of the following array:

1, 1, 1, 1, 1, ... (1-bonacci numbers)

1, 1, 2, 3, 5, ... (2-bonacci or Fibonacci numbers)

1, 1, 1, 3, 5, ... (3-bonacci or tribonacci numbers)

1, 1, 1, 1, 4, ... (4-bonacci or tetranacci numbers)

...

For n >= 3, this sequence is 2 + antidiagonal sums of A061451.

Links

Table of n, a(n) for n=1..35.

Formula

a(n) = Sum_{i=1..n} nac(i,n) where nac(i,n) = 1 if 1 <= n <= i, Sum_{k=1..i} nac(i,n-k) if n > i.

Maple

b:= proc(i, n) option remember; `if`(n=0, 0,
      `if`(n<=i, 1, add(b(i, n-j), j=1..i)))
    end:
a:= n-> add(b(i, n), i=1..n):
seq(a(n), n=1..36);  # Alois P. Heinz, Jun 16 2021

Mathematica

b[i_, n_] := b[i, n] = If[n==0, 0,
     If[n<=i, 1, Sum[b[i, n-j], {j, 1, i}]]];
a[n_] := Sum[b[i, n], {i, 1, n}];
Table[a[n], {n, 1, 36}] (* Jean-François Alcover, May 29 2022, after Alois P. Heinz *)

Crossrefs

Cf. A000045, A000213, A000288, A000322, A000383, A060455, A061451.

Sequence in context: A102726 A188900 A189075 * A189077 A118891 A107066

Adjacent sequences: A345369 A345370 A345371 * A345373 A345374 A345375

Keyword

nonn

Author

Christoph B. Kassir, Jun 16 2021

Status

approved