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!)
A184478 Lower s-Wythoff sequence, where s(n) = 3n + 1. Complement of A184479. 2

%I #16 Sep 08 2022 08:45:55

%S 1,2,3,4,6,7,8,10,11,12,14,15,16,18,19,20,21,23,24,25,27,28,29,31,32,

%T 33,34,36,37,38,40,41,42,44,45,46,47,49,50,51,53,54,55,57,58,59,60,62,

%U 63,64,66,67,68,70,71,72,74,75,76,77,79,80,81,83,84,85,87,88,89,90,92,93,94,96,97,98,100,101,102,103,105,106,107,109,110,111,113,114,115,117,118,119,120,122,123,124,126,127,128,130,131,132,133,135,136,137,139,140,141,143,144,145,146,148,149,150,152,153,154,156

%N Lower s-Wythoff sequence, where s(n) = 3n + 1. Complement of A184479.

%C See A184117 for the definition of lower and upper s-Wythoff sequences.

%C The sequence is defined by a(1) = 1 and for n > 1, a(n) is the smallest positive integer not in {a(k), a(k) + s(k); k < n}. - _M. F. Hasler_, Jan 07 2019

%F a(n) = A184479(n) - s(n). - _M. F. Hasler_, Jan 07 2019

%p a:=n->floor(n*(-1+sqrt(13))/2+1): seq(a(n),n=0..120); # _Muniru A Asiru_, Jan 08 2019

%t k=3; r=-1; d=Sqrt[4+k^2];

%t a[n_]:=Floor[(1/2)(d+2-k)(n+r/(d+2))];

%t b[n_]:=Floor[(1/2)(d+2+k)(n-r/(d+2))];

%t Table[a[n],{n,120}]

%t Table[b[n],{n,120}]

%t Table[(Floor[n (-1 + Sqrt[13]) / 2]) + 1, {n, 0, 120}] (* _Vincenzo Librandi_, Jan 08 2019 *)

%o (PARI) A184478_upto(N, s(n)=3*n+1, a=[1], U=a)={while(a[#a]<N, U=setunion(U, [a[#a], a[#a]+s(#a)]); while(#U>1&&U[2]==U[1]+1, U=U[^1]); a=concat(a, U[1]+1)); a} \\ _M. F. Hasler_, Jan 07 2019

%o (Magma) [(Floor(n*(-1+Sqrt(13))/2))+1: n in [0..120]]; // _Vincenzo Librandi_, Jan 08 2019

%Y Cf. A184117, A184479, A184480.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 15 2011

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 09:14 EDT 2024. Contains 371268 sequences. (Running on oeis4.)