The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274193 Triangular array read by rows: g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,3k) for n > 0, k > 1. 6
 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, 3, 3, 2, 2, 1, 1, 1, 1, 3, 4, 3, 2, 2, 1, 1, 1, 1, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 5, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 6, 7, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 8, 9, 8, 7, 5, 4, 3 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,12 LINKS Clark Kimberling, Table of n, a(n) for n = 0..10000 EXAMPLE First 10 rows: 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 3 3 2 2 1 1 1 1 3 4 3 2 2 1 1 1 1 4 4 4 3 2 2 1 1 1 MATHEMATICA g[n_, 0] = g[n, 0] = 1; g[n_, k_] := g[n, k] = If[k > n, 0, g[n - 1, k - 1] + g[n - 1, 3 k]]; t = Table[g[n, k], {n, 0, 14}, {k, 0, n}] TableForm[t] (* A274193 array *) u = Flatten[t] (* A274193 sequence *) CROSSREFS Cf. A274194 (row sums), A274195, A274200 (limiting reverse row), A274190, A274196. Sequence in context: A322812 A259094 A306741 * A238384 A139040 A139147 Adjacent sequences: A274190 A274191 A274192 * A274194 A274195 A274196 KEYWORD nonn,tabl,easy AUTHOR Clark Kimberling, Jun 14 2016 STATUS approved

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

Last modified December 11 10:53 EST 2023. Contains 367722 sequences. (Running on oeis4.)