1,2

Jeremy Patrick List, Table of n, a(n) for n = 1..2000

(Haskell) f = 1:2:(f' 4 $ skip 3 3 [3..])

f' c (n:r) = n:(f' (c + 1) $ skip n c r)

skip i c (l:r) | c == i = skip i 1 r ; | otherwise = l:(skip i (c + 1) r)

Cf. A000959.

Sequence in context: A047236 A039581 A338420 * A093701 A045601 A167051

Adjacent sequences: A182215 A182216 A182217 * A182219 A182220 A182221

easy,nonn

Jeremy Patrick List, Apr 19 2012

approved