

A116511


Table T(n,k) = number of strictly increasing addition chains of length n whose final value is k.


0



1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 2, 0, 1, 0, 0, 0, 0, 1, 3, 5, 5, 3, 4, 0, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 4, 9, 14, 17, 15, 17, 10, 14, 4, 10, 2, 7, 0, 6, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 5, 14, 28, 45, 60, 67, 78, 66, 81, 51, 73, 33, 65, 29, 40, 4, 47, 14, 24, 5, 23, 0, 12
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,12


COMMENTS

Row n has 2^(n1) entries (starting with n1 zeros).


LINKS

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


EXAMPLE

Table starts:
1,
0,1,
0,0,1,1,
0,0,0,1,2,2,0,1,
0,0,0,0,1,3,5,5,3,4,0,3,0,0,0,1,


CROSSREFS

Row sums A008933, column sums A008928.
Sequence in context: A087637 A052458 A004586 * A248211 A049502 A242284
Adjacent sequences: A116508 A116509 A116510 * A116512 A116513 A116514


KEYWORD

nonn,tabl


AUTHOR

Franklin T. AdamsWatters, Mar 22 2006


STATUS

approved



