The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190188 a(n) = [n*u+n*v]-[n*u]-[n*v], where u=e, v=1/e, and []=floor. 3

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

%S 1,1,0,1,1,0,0,1,0,0,0,1,1,0,1,1,0,1,1,0,0,0,0,1,1,1,1,0,1,0,0,1,0,0,

%T 1,1,1,1,0,1,0,0,1,0,0,0,1,1,0,1,1,0,0,1,0,0,1,0,1,0,1,1,0,1,1,0,0,0,

%U 0,1,1,1,1,0,1,1,0,0,0,0,0,1,1,1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,0,1,0,1,1,1,1,0,0,1,0,0,1,0,0,0,1,1,0

%N a(n) = [n*u+n*v]-[n*u]-[n*v], where u=e, v=1/e, and []=floor.

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

%F a(n) = [n*e + n/e]-[n*e]-[n/e].

%t u = E; v = 1/E;

%t f[n_] := Floor[n*u + n*v] - Floor[n*u] - Floor[n*v]

%t t = Table[f[n], {n, 1, 120}] (*A190188*)

%t Flatten[Position[t, 0]] (*A190189*)

%t Flatten[Position[t, 1]] (*A190190*)

%t Table[Floor[2*n*Cosh[1]] - Floor[n*Exp[1]] - Floor[n*Exp[-1]], {n,1,50}] (* _G. C. Greubel_, Dec 28 2017 *)

%o (PARI) for(n=1,30, print1(floor(2*n*cosh(1)) - floor(n*exp(1)) - floor(n*exp(-1)), ", ")) \\ _G. C. Greubel_, Dec 27 2017

%o (Magma) [Floor(2*n*Cosh(1)) - Floor(n*Exp(1)) - Floor(n*Exp(-1)): n in [1..30]]; // _G. C. Greubel_, Dec 27 2017

%Y Cf. A190189, A190190.

%K nonn

%O 1

%A _Clark Kimberling_, May 05 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.

Last modified September 30 19:54 EDT 2023. Contains 365793 sequences. (Running on oeis4.)