login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 8
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 (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, A056232, A056234. See also A057153, A052474, A057154, A056230.

Sequence in context: A035198 A271186 A253705 * A260264 A126623 A235361

Adjacent sequences:  A056230 A056231 A056232 * A056234 A056235 A056236

KEYWORD

nonn,nice,easy

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 04:33 EDT 2019. Contains 328026 sequences. (Running on oeis4.)