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!)
A194979 a(n) = 1 + floor(n/sqrt(3)). 6

%I #29 Mar 05 2024 19:32:16

%S 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 17,18,18,19,20,20,21,21,22,22,23,24,24,25,25,26,26,27,28,28,29,29,30,

%U 31,31,32,32,33,33,34,35,35,36,36,37,37,38,39,39,40,40,41,41

%N a(n) = 1 + floor(n/sqrt(3)).

%C The fractalization of this sequence is A194980.

%C Least number k such that k*tan(1/k) - 1 < 1/n^2. - _Clark Kimberling_, Dec 02 2014

%C The integers k such that a(k) = a(k+1) give A054406. - _Michel Marcus_, Nov 01 2021

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

%F a(n) = 1 + A097337(n).

%t p[n_]:=1+Floor[n/Sqrt[3]]

%t Table[p[n],{n,1,90}] (* A194979 *)

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

%o (PARI) a(n)=1+sqrtint(n^2\3) \\ _Charles R Greathouse IV_, Sep 02 2015

%Y Cf. A054406, A097337, A194980, A194981.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Sep 07 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 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)