A050136 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A050136

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

1, 10, 5, 2, 25, 12, 6, 3, 45, 22, 11, 60, 30, 15, 7, 80, 40, 20, 95, 47, 23, 110, 55, 27, 13, 130, 65, 32, 16, 8, 4, 160, 165, 82, 41, 180, 90, 190, 195, 97, 48, 24, 215, 107, 53, 26, 235, 117, 58, 29, 14, 260, 265, 132, 66, 33, 285, 142, 71, 35, 17, 310, 155, 77, 38, 19, 9, 340, 170, 85, 42, 21

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Does this sequence contain every positive integer exactly once?

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

S:= {0, 1}: A[1]:= 1:

for n from 2 to 100 do

v:= floor(A[n-1]/2);

if not member(v, S) then A[n]:= v

else A[n]:= 5*n

fi;

S:= S union {A[n]};

od:

seq(A[i], i=1..100); # Robert Israel, Aug 07 2018

MATHEMATICA

f[s_List] := Block[{len = Length@s, m = Floor[s[[-1]]/2]}, Append[s, If[MemberQ[s, m], 5 len, m]]]; Rest@ Nest[f, {0, 1}, 65] (* Robert G. Wilson v, Aug 07 2018 *)

CROSSREFS

Cf. A050000, A050128, A050132, A050135.

Sequence in context: A117256 A332837 A050020 * A053050 A033330 A214427

Adjacent sequences: A050133 A050134 A050135 * A050137 A050138 A050139

KEYWORD

nonn,look

AUTHOR

Clark Kimberling

EXTENSIONS

Corrected by Robert Israel, Aug 07 2018

STATUS

approved