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 A194979 #29 Mar 05 2024 19:32:16
%S A194979 1,2,2,3,3,4,5,5,6,6,7,7,8,9,9,10,10,11,11,12,13,13,14,14,15,16,16,17,
%T A194979 17,18,18,19,20,20,21,21,22,22,23,24,24,25,25,26,26,27,28,28,29,29,30,
%U A194979 31,31,32,32,33,33,34,35,35,36,36,37,37,38,39,39,40,40,41,41
%N A194979 a(n) = 1 + floor(n/sqrt(3)).
%C A194979 The fractalization of this sequence is A194980.
%C A194979 Least number k such that k*tan(1/k) - 1 < 1/n^2. - _Clark Kimberling_, Dec 02 2014
%C A194979 The integers k such that a(k) = a(k+1) give A054406. - _Michel Marcus_, Nov 01 2021
%H A194979 Vincenzo Librandi, <a href="/A194979/b194979.txt">Table of n, a(n) for n = 1..10000</a>
%F A194979 a(n) = 1 + A097337(n).
%t A194979 p[n_]:=1+Floor[n/Sqrt[3]]
%t A194979 Table[p[n],{n,1,90}] (* A194979 *)
%o A194979 (Magma) [1+Floor(n/Sqrt(3)): n in [1..80] ];// _Vincenzo Librandi_, Sep 10 2011
%o A194979 (PARI) a(n)=1+sqrtint(n^2\3) \\ _Charles R Greathouse IV_, Sep 02 2015
%Y A194979 Cf. A054406, A097337, A194980, A194981.
%K A194979 nonn,easy
%O A194979 1,2
%A A194979 _Clark Kimberling_, Sep 07 2011