login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,13
COMMENTS
The Padovan sequence is pushed back to a(-1)=1, so that the triangle is not almost all ones.
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
Sequence in context: A155052 A096284 A163100 * A322812 A259094 A306741
KEYWORD
nonn,tabl,less
AUTHOR
EXTENSIONS
Edited by N. J. A. Sloane, Feb 28 2009
Non-ASCII characters in %t line corrected by Wouter Meeussen, Feb 10 2013
Definition corrected and offset changed by Georg Fischer, May 16 2024
STATUS
approved