OFFSET

1,2

COMMENTS

LINKS

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

Phil Carmody, Re: New sieve and a challenge

Jon Perry, New sieve and a challenge

Jon Perry and Phil Carmody, New sieve and a challenge, digest of 4 messages in primenumbers Yahoo group, Oct 11, 2002.

EXAMPLE

We start with a(1)=1. Then 2 is not included since it has one bit set and 1 is in the sequence. Next, 3 is included since it has 2 one bits and 2 is not in the sequence. And so on.

PROG

(PARI) v=vector(1000): v[1]=1: for(curr=2, 1000, e=A000120(curr): if(v[e], continue, v[curr]=1)): for(k=1, 1000, if(v[k], print1(k", ")))

(Haskell)

a075311 n = a075311_list !! (n-1)

a075311_list = 1 : f 2 [1] where

f x ys = if a000120 x `elem` ys then f (x + 1) ys

else x : f (x + 1) (x : ys)

-- _Reinhard Zumkeller_, Apr 22 2012

CROSSREFS

KEYWORD

easy,nonn

AUTHOR

_Phil Carmody_, Oct 11 2002

EXTENSIONS

Edited by _Ralf Stephan_, Sep 14 2003

STATUS

approved