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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = [n*e + n/e]-[n*e]-[n/e]. MATHEMATICA u = E; v = 1/E; f[n_] := Floor[n*u + n*v] - Floor[n*u] - Floor[n*v] t = Table[f[n], {n, 1, 120}] (*A190188*) Flatten[Position[t, 0]] (*A190189*) Flatten[Position[t, 1]] (*A190190*) Table[Floor[2*n*Cosh[1]] - Floor[n*Exp[1]] - Floor[n*Exp[-1]], {n, 1, 50}] (* G. C. Greubel, Dec 28 2017 *) PROG (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 (Magma) [Floor(2*n*Cosh(1)) - Floor(n*Exp(1)) - Floor(n*Exp(-1)): n in [1..30]]; // G. C. Greubel, Dec 27 2017 CROSSREFS Cf. A190189, A190190. Sequence in context: A189094 A041004 A141736 * A278513 A134842 A167753 Adjacent sequences: A190185 A190186 A190187 * A190189 A190190 A190191 KEYWORD nonn AUTHOR Clark Kimberling, May 05 2011 STATUS approved

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 June 8 03:07 EDT 2023. Contains 363157 sequences. (Running on oeis4.)