

A056232


Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 2.


8



3, 6, 11, 15, 18, 22, 25, 27, 30, 35, 39, 41, 44, 51, 59, 63, 66, 70, 73, 75, 81, 88, 91, 94, 97, 99, 103, 107, 109, 111, 114, 118, 121, 123, 126, 131, 135, 137, 140, 147, 153, 155, 157, 161, 165, 167, 170, 173, 176, 181, 188, 194, 198, 201, 203
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000


EXAMPLE

Array begins
1 2 4 7 8 10 12 ...
.3 6 11 15 18 ...
. 9 17 26 33 ...


PROG

(Haskell) cf. A056231.


CROSSREFS

Cf. A056231, A056233, A056234. See also A057153, A052474, A057154, A056230.
Sequence in context: A310097 A310098 A310099 * A229035 A187896 A225521
Adjacent sequences: A056229 A056230 A056231 * A056233 A056234 A056235


KEYWORD

nonn,nice,easy


AUTHOR

N. J. A. Sloane, E. M. Rains, Aug 22 2000


STATUS

approved



