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

%I #12 Jan 07 2019 04:27:03

%S 5,9,13,17,22,26,30,35,39,43,48,52,56,61,65,69,73,78,82,86,91,95,99,

%T 104,108,112,116,121,125,129,134,138,142,147,151,155,159,164,168,172,

%U 177,181,185,190,194,198,202,207,211,215,220,224,228,233,237,241,246

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

%H M. F. Hasler, <a href="/A184479/b184479.txt">Table of n, a(n) for n = 1..1000</a>, Jan 07 2019

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

%F For n up to 1000 at least, a(n) = round(m*n + c) with m ~ 4.302774 and c ~ 0.268517. - _M. F. Hasler_, Jan 07 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}]

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

%Y Cf. A184117, A184478.

%K nonn

%O 1,1

%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 April 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)