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!)
A050135 a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 4*n. 5

%I #14 Oct 15 2019 11:51:51

%S 1,8,4,2,20,10,5,32,16,40,44,22,11,56,28,14,7,3,76,38,19,9,92,46,23,

%T 104,52,26,13,6,124,62,31,15,140,70,35,17,156,78,39,168,84,42,21,184,

%U 188,94,47,200,100,50,25,12,220,110,55,27,236

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

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

%Y Cf. A050000.

%K nonn

%O 1,2

%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 March 29 04:59 EDT 2024. Contains 371264 sequences. (Running on oeis4.)