The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A139039 A triangular central symmetric sequence based on the sequence A003269: if m <= floor(n/2), t(n,m) = A003269(m+2), otherwise t(n,m) = A003269(n - (m+2)). 0
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 1, 1, 2, 3, 3, 2, 1, 1, 1, 1, 1, 1, 2, 3, 4, 3, 2, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,25 COMMENTS Row sums: {1, 2, 3, 4, 5, 6, 8, 10, 13, 16, 20, ...}. [Is this A186445 or A080078? - N. J. A. Sloane, Feb 10 2013] The A003269 sequence is pushed back twice, so that the triangle is not almost all ones. LINKS FORMULA a(n) = a(n-1) + a(n-4); t(n,m) = a(m) if m <= floor(n/2), a(n-m) otherwise. EXAMPLE {1}, {1, 1}, {1, 1, 1}, {1, 1, 1, 1}, {1, 1, 1, 1, 1}, {1, 1, 1, 1, 1, 1}, {1, 1, 1, 2, 1, 1, 1}, {1, 1, 1, 2, 2, 1, 1, 1}, {1, 1, 1, 2, 3, 2, 1, 1, 1}, {1, 1, 1, 2, 3, 3, 2, 1, 1, 1}, {1, 1, 1, 2, 3, 4, 3, 2, 1, 1, 1} MATHEMATICA Clear[a]; a[ -2] = 0; a[ -1] = 1; a[0] = 1; a[1] = 1; a[n_] := a[n] = a[n - 1] + a[n - 4]; (* A003269 *) Table[If[m <= Floor[n/2], a[m], a[n-m] ] , {n, 0, 10}, {m, 0, n}] CROSSREFS Cf. A139147, A003269. Sequence in context: A319582 A187447 A146292 * A279061 A206491 A122172 Adjacent sequences:  A139036 A139037 A139038 * A139040 A139041 A139042 KEYWORD nonn,tabl,uned AUTHOR Roger L. Bagula and Gary W. Adamson, May 31 2008 EXTENSIONS Non-ASCII characters removed and Mathematica code corrected by Wouter Meeussen, Feb 10 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 12:34 EDT 2020. Contains 337289 sequences. (Running on oeis4.)