The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274194 Row sums of the array A274193, defined by 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. 3
1, 2, 3, 4, 6, 8, 10, 14, 18, 23, 31, 40, 52, 68, 88, 114, 148, 192, 249, 323, 420, 545, 707, 919, 1191, 1547, 2009, 2606, 3386, 4396, 5707, 7413, 9623, 12496, 16228, 21069, 27363, 35531, 46139, 59920, 77806, 101043, 131215, 170392, 221283, 287355, 373168 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
See A274195 for the limit of a(n)/a(n-1).
LINKS
EXAMPLE
(g(9,k)) = (1,4,4,4,3,2,2,1,1,1), so that a(9) = 23.
MATHEMATICA
z = 150; 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, z}, {k, 0, n}]; w = Map[Total, t];
CROSSREFS
Sequence in context: A102848 A260183 A134157 * A237751 A045476 A368381
KEYWORD
nonn,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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 13:48 EDT 2024. Contains 372519 sequences. (Running on oeis4.)