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!)
A190007 a(n) = n + [n*r/s] + [n*t/s]; r=1, s=sin(Pi/3), t=csc(Pi/3). 3

%I #11 Sep 08 2022 08:45:56

%S 3,6,10,13,16,20,24,27,31,34,37,41,45,48,52,55,58,62,65,69,73,76,79,

%T 83,86,90,94,97,100,104,107,110,115,118,121,125,128,131,136,139,142,

%U 146,149,152,156,160,163,167,170,173,177,181,184,188,191,194,198,201,205,209,212,215,219,222,226,230,233,236,240,243,246,251,254

%N a(n) = n + [n*r/s] + [n*t/s]; r=1, s=sin(Pi/3), t=csc(Pi/3).

%C See A190006.

%H G. C. Greubel, <a href="/A190007/b190007.txt">Table of n, a(n) for n = 1..10000</a>

%F A190006: a(n) = n + [n*sin(Pi/3)] + [n*csc(Pi/3].

%F A190007: b(n) = n + [n*csc(Pi/3)] + [n*(csc(Pi/3))^2].

%F A190008: c(n) = n + [n*sin(Pi/3)] + [n*(sin(Pi/3))^2].

%t r=1; s=Sin[Pi/3]; t=Csc[Pi/3];

%t a[n_] := n + Floor[n*s/r] + Floor[n*t/r];

%t b[n_] := n + Floor[n*r/s] + Floor[n*t/s];

%t c[n_] := n + Floor[n*r/t] + Floor[n*s/t];

%t Table[a[n], {n, 1, 120}] (* A190006 *)

%t Table[b[n], {n, 1, 120}] (* A190007 *)

%t Table[c[n], {n, 1, 120}] (* A190008 *)

%o (PARI) for(n=1,100, print1(n + floor(n/sin(Pi/3)) + floor(n/(sin(Pi/3))^2), ", ")) \\ _G. C. Greubel_, Jan 11 2018

%o (Magma) C<i> := ComplexField(); [n + Floor(n/Sin(Pi(C)/3)) + Floor(n/(Sin(Pi(C)/3))^2): n in [1..100]]; // _G. C. Greubel_, Jan 11 2018

%Y Cf. A190006, A190008.

%K nonn

%O 1,1

%A _Clark Kimberling_, May 03 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 16 11:08 EDT 2024. Contains 371711 sequences. (Running on oeis4.)