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!)
A213944 Triangle read by rows, with column k defined by partial sums of the finite sequence that contains k three times. 1
1, 2, 0, 3, 2, 0, 3, 4, 0, 0, 3, 6, 3, 0, 0, 3, 6, 6, 0, 0, 0, 3, 6, 9, 4, 0, 0, 0, 3, 6, 9, 8, 0, 0, 0, 0, 3, 6, 9, 12, 5, 0, 0, 0, 0, 3, 6, 9, 12, 10, 0, 0, 0, 0, 0, 3, 6, 9, 12, 15, 6, 0, 0, 0, 0, 0, 3, 6, 9, 12, 15, 12 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
T(n,k) = 0 if 2k > n+1. T(n,k) = k if 2k=n+1. T(n,k)=2k if 2k=n. T(n,k) = 3k if 2k <= n-1.
EXAMPLE
First few rows of the triangle are:
1;
2, 0;
3, 2, 0;
3, 4, 0, 0;
3, 6, 3, 0, 0;
3, 6, 6, 0, 0, 0;
3, 6, 9, 4, 0, 0, 0;
3, 6, 9, 8, 0, 0, 0, 0;
3, 6, 9, 12, 5, 0, 0, 0, 0;
3, 6, 9, 12, 10, 0, 0, 0, 0, 0;
3, 6, 9, 12, 15, 6, 0, 0, 0, 0, 0;
3, 6, 9, 12, 15, 12, 0, 0, 0, 0, 0, 0;
...
MATHEMATICA
fs[n_, k_]:=Which[2k>n+1, 0, 2k==n+1, k, 2k==n, 2k, 2k<=n-1, 3k]; Flatten[ Table[ fs[n, k], {n, 15}, {k, n}]] (* Harvey P. Dale, Mar 06 2013 *)
CROSSREFS
Cf. A001318 (row sums)
Sequence in context: A120854 A035159 A103489 * A127479 A284124 A187637
KEYWORD
nonn,tabl,less,easy
AUTHOR
Gary W. Adamson, Jun 25 2012
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 26 21:09 EDT 2024. Contains 372844 sequences. (Running on oeis4.)