

A144149


Weight array W={w(i,j)} of the Wythoff difference array A080164.


0



1, 1, 2, 3, 3, 1, 8, 8, 2, 2, 21, 21, 5, 3, 2, 55, 55, 13, 8, 3, 1, 144, 144, 34, 21, 8, 2, 2, 377, 377, 89, 55, 21, 5, 3, 1, 987, 987, 233, 144, 55, 13, 8, 2, 2, 2584, 2584, 610, 377, 144, 34, 21, 5, 3, 2, 6765, 6765, 1597, 987, 377, 89, 55, 13, 8, 3, 1, 17711, 17711, 4181
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


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 Wythoff difference array, A080164.


LINKS

Table of n, a(n) for n=1..69.


FORMULA

row 1: 1 followed by A001906, except for initial 0
row n: A001519 (except for initial 1) is n is in 1+A001950
row n: A001906 (except for initial 0) if n is in 1+A000201.


EXAMPLE

S(2,4)=1+1+3+8+2+3+8+21=47.


CROSSREFS

A000045, A144112, A144148.
Sequence in context: A236937 A323748 A116155 * A097005 A068008 A123948
Adjacent sequences: A144146 A144147 A144148 * A144150 A144151 A144152


KEYWORD

nonn,tabl


AUTHOR

Clark Kimberling, Sep 11 2008


STATUS

approved



