This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182778 #20 Sep 08 2022 08:45:55
%S A182778 4,9,14,18,23,28,33,37,42,47,52,56,61,66,70,75,80,85,89,94,99,104,108,
%T A182778 113,118,123,127,132,137,141,146,151,156,160,165,170,175,179,184,189,
%U A182778 194,198,203,208,212,217,222,227,231,236,241,246,250,255
%N A182778 Beatty sequence for 3 + sqrt(3).
%C A182778 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 A182778 Vincenzo Librandi, <a href="/A182778/b182778.txt">Table of n, a(n) for n = 1..10000</a>
%F A182778 a(n) = floor(n*(3 + sqrt(3))).
%F A182778 From _Miko Labalan_, Dec 17 2016: (Start)
%F A182778 a(n) = 3n + A022838(n);
%F A182778 For n > 0, a(n) = 5*floor(n*(sqrt(3)-1)) + 4*floor(n*(2-sqrt(3))) + 4;
%F A182778 a(0) = 0, a(n) = a(n - 1) + A022838(n) - A022838(n - 1) + 3.
%F A182778 (End)
%t A182778 Table[Floor[(3+Sqrt[3])*n], {n, 54}]
%o A182778 (Magma) [Floor(n*(3+Sqrt(3))): n in [1..80]]; // _Vincenzo Librandi_, Oct 25 2011
%Y A182778 Cf. A182760, A182777.
%K A182778 nonn
%O A182778 1,1
%A A182778 _Clark Kimberling_, Nov 30 2010
%E A182778 Typo in formula corrected by _Vincenzo Librandi_, Oct 25 2011