|
|
A139038
|
|
Triangle read by rows: T(n,m) = A000931(m+6) if m <= floor(n/2), A000931(n+6-m) otherwise, for 0 <= m <= n.
|
|
4
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 3, 2, 2, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 1, 1, 1, 1, 2, 2, 3, 4, 3, 2, 2, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,13
|
|
COMMENTS
|
The Padovan sequence is pushed back to a(-1)=1, so that the triangle is not almost all ones.
|
|
LINKS
|
|
|
EXAMPLE
|
The triangle begins:
1;
1, 1;
1, 1, 1;,
1, 1, 1, 1;
1, 1, 2, 1, 1;
1, 1, 2, 2, 1, 1;
1, 1, 2, 2, 2, 1, 1;
1, 1, 2, 2, 2, 2, 1, 1;
1, 1, 2, 2, 3, 2, 2, 1, 1;
1, 1, 2, 2, 3, 3, 2, 2, 1, 1;
1, 1, 2, 2, 3, 4, 3, 2, 2, 1, 1;
...
|
|
MATHEMATICA
|
a[-1] = 1; a[0] = 1; a[1] = 1; a[n_] := a[n] = a[n - 2] + a[n - 3]; (* Padovan : A000931 *)
Table[If[m <= Floor[n/2], a[m], a[n - m]], {n, 0, 10}, {m, 0, n}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Definition corrected and offset changed by Georg Fischer, May 16 2024
|
|
STATUS
|
approved
|
|
|
|