A056233 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 3.
9, 17, 26, 33, 40, 47, 52, 57, 65, 74, 80, 85, 95, 110, 122, 129, 136, 143, 148, 156, 169, 179, 185, 191, 196, 202, 210, 216, 220, 225, 232, 239, 244, 249, 257, 266, 272, 277, 287, 300, 308, 312, 318, 326, 332, 337, 343, 349, 357, 369, 382
Offset: 1
Examples
Array begins 1 2 4 7 8 10 12 ... .3 6 11 15 18 ... . 9 17 26 33 ...
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Programs
-
Haskell
cf. A056231.