OFFSET
1,1
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..514
EXAMPLE
Array begins
1 3 9 26 73 194 ...
.2 6 17 47 121 ...
. 4 11 30 74 ...
.. 7 19 44 ...
... 12 25 ...
.... 13 ...
PROG
(Haskell)
import Data.List (intersect, union, (\\))
a057154 n = a057154_list !! (n-1)
a057154_list = g [1] [2..] [1] where
g ds (a:as) us
| null (ds' `intersect` us) = g ds' (as \\ ds') (us `union` ds')
| otherwise = a : g ds as us
where ds' = scanl (+) a ds
-- Reinhard Zumkeller, Nov 19 2011
CROSSREFS
KEYWORD
nice,nonn,easy
AUTHOR
Jonas Wallgren, Jul 30 2000
EXTENSIONS
More terms from Rob Speer (rob(AT)twcny.rr.com) and Loren Merritt, Aug 14 2000
Further terms from Larry Reeves (larryr(AT)acm.org), May 09 2001
STATUS
approved