login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050137 a(1)=2; a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*n. 1

%I #10 Oct 15 2019 12:01:06

%S 2,1,6,3,10,5,14,7,18,9,4,24,12,28,30,15,34,17,8,40,20,44,22,11,50,25,

%T 54,27,13,60,62,31,66,33,16,72,36,76,38,19,82,41,86,43,21,92,46,23,98,

%U 49,102,51,106,53,26,112,56,116,58,29,122,61

%N a(1)=2; a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*n.

%C Does this sequence contain every positive integer exactly once?

%Y Cf. A050000, A050004, A050128, A050132, A050135, A050136, A050138, A050196.

%K nonn

%O 1,1

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 02:04 EDT 2024. Contains 371782 sequences. (Running on oeis4.)