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!)
A144113 Weight array W={w(i,j)} of the natural number array A038722. 0
1, 2, 1, 3, 1, 2, 4, 1, 1, 3, 5, 1, 1, 1, 4, 6, 1, 1, 1, 1, 5, 7, 1, 1, 1, 1, 1, 6, 8, 1, 1, 1, 1, 1, 1, 7, 9, 1, 1, 1, 1, 1, 1, 1, 8, 10, 1, 1, 1, 1, 1, 1, 1, 1, 9, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
In general, let w(i,j) be the weight of the unit square labeled by its
northeast vertex (i,j) and for each (m,n), define
S(m,n)=SUM{SUM{w(i,j), i=1,2,...,m, j=1,2,...,n}.
Then S(m,n) is the weight of the rectangle [0,m]x[0,n]. We call W the weight
array of S and we call S the accumulation array of W. For the case at hand, S is
the array of natural numbers having the following antidiagonals:
(1), then (3,2), then (6,5,4), then (10,9,8,7) and so on.
LINKS
FORMULA
row 1: A000027
row n: n-1 followed by A000012, for n>1.
EXAMPLE
S(2,4)=1+1+2+3+2+1+1+1=14.
CROSSREFS
Sequence in context: A365138 A228812 A341049 * A370329 A304038 A366113
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Sep 11 2008
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)