

A232089


Table read by rows, which consist of 1 followed by 2^k, 0 <= k < n ; n = 0,1,2,3,...


1



1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 4, 8, 1, 1, 2, 4, 8, 16, 1, 1, 2, 4, 8, 16, 32, 1, 1, 2, 4, 8, 16, 32, 64, 1, 1, 2, 4, 8, 16, 32, 64, 128, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,6


COMMENTS

The nth row consists of the n+1 terms A011782(k), k=0,...,n. Thus the rows converge to A011782, which is also equal to the diagonal = last element of each row.
This (read as a "linear" sequence) is also the limit of the rows of A232088; more precisely, for n>0, each row of A232088 consists of the first n(n+1)/2 elements of this sequence, followed by 2^(n1). See the LINK there for one motivation for this sequence.


LINKS

Table of n, a(n) for n=0..65.


FORMULA

T(n,k) = max(1,2^(k1)) = A011782(k); 0 <= k <= n.


EXAMPLE

The table reads:
1,
1, 1,
1, 1, 2,
1, 1, 2, 4,
1, 1, 2, 4, 8,
1, 1, 2, 4, 8, 16,
1, 1, 2, 4, 8, 16, 32,
1, 1, 2, 4, 8, 16, 32, 64, etc.


PROG

(PARI) for(n=0, 10, print1("1, "); for(k=0, n1, print1(2^k, ", ")))


CROSSREFS

Sequence in context: A245195 A182105 A023506 * A141021 A140995 A140994
Adjacent sequences: A232086 A232087 A232088 * A232090 A232091 A232092


KEYWORD

nonn,tabl,easy


AUTHOR

M. F. Hasler, Jan 20 2014


STATUS

approved



