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!)
A182778 Beatty sequence for 3 + sqrt(3). 4

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

%S 4,9,14,18,23,28,33,37,42,47,52,56,61,66,70,75,80,85,89,94,99,104,108,

%T 113,118,123,127,132,137,141,146,151,156,160,165,170,175,179,184,189,

%U 194,198,203,208,212,217,222,227,231,236,241,246,250,255

%N Beatty sequence for 3 + sqrt(3).

%C Let u=2-sqrt(3) and v=1. Jointly rank {ju} and {kv} as in the first comment at A182760; a(n) is the position of n. A182778 is the complement of A182777.

%H Vincenzo Librandi, <a href="/A182778/b182778.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = floor(n*(3 + sqrt(3))).

%F From _Miko Labalan_, Dec 17 2016: (Start)

%F a(n) = 3n + A022838(n);

%F For n > 0, a(n) = 5*floor(n*(sqrt(3)-1)) + 4*floor(n*(2-sqrt(3))) + 4;

%F a(0) = 0, a(n) = a(n - 1) + A022838(n) - A022838(n - 1) + 3.

%F (End)

%t Table[Floor[(3+Sqrt[3])*n], {n, 54}]

%o (Magma) [Floor(n*(3+Sqrt(3))): n in [1..80]]; // _Vincenzo Librandi_, Oct 25 2011

%Y Cf. A182760, A182777.

%K nonn

%O 1,1

%A _Clark Kimberling_, Nov 30 2010

%E Typo in formula corrected by _Vincenzo Librandi_, Oct 25 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 May 10 16:16 EDT 2024. Contains 372387 sequences. (Running on oeis4.)