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

%I #15 Oct 06 2019 02:56:35

%S 1,2,4,8,16,3,6,12,24,48,9,18,36,7,14,28,5,10,20,40,80,160,32,64,128,

%T 25,50,100,200,400,800,1600,320,640,1280,256,51,102,204,408,81,162,

%U 324,648,129,258,516,103,206,41,82,164,328,65

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

%H Ivan Neretin, <a href="/A050124/b050124.txt">Table of n, a(n) for n = 1..10000</a>

%t Rest@Nest[Append[#, If[FreeQ[#, r = Quotient[#[[-1]], 5]], r, 2 #[[-1]]]] &, {0, 1}, 53] (* _Ivan Neretin_, Jul 31 2016 *)

%Y Cf. A050000 and references therein.

%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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)