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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190305 a(n) = n + [n*r/s] + [n*t/s]; r=1, s=csch(1), t=sech(1). 3
 2, 5, 8, 11, 13, 17, 20, 23, 25, 28, 31, 35, 37, 40, 43, 46, 48, 52, 55, 58, 60, 63, 67, 70, 73, 75, 78, 81, 85, 87, 90, 93, 96, 98, 102, 105, 108, 110, 113, 117, 120, 122, 125, 128, 131, 135, 137, 140, 143, 146, 148, 152, 155, 158, 160, 163, 166, 170, 172, 175, 178, 181, 184, 187, 190, 193, 196, 198, 202, 205, 208, 210 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See A190304. LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA A190304: a(n)=n+[n*csch(1)]+[n*sech(1)]. A190305: b(n)=n+[n*sinh(1)]+[n*tanh(1)]. A190306: c(n)=n+[n*cosh(1)]+[n*coth(1)]. MATHEMATICA r=1; s=Csch[1]; t=Sech[1]; a[n_] := n + Floor[n*s/r] + Floor[n*t/r]; b[n_] := n + Floor[n*r/s] + Floor[n*t/s]; c[n_] := n + Floor[n*r/t] + Floor[n*s/t]; Table[a[n], {n, 1, 120}] (* A190304 *) Table[b[n], {n, 1, 120}] (* A190305 *) Table[c[n], {n, 1, 120}] (* A190306 *) PROG (PARI) for(n=1, 30, print1(n + floor(n*sinh(1)) + floor(n*tanh(1)), ", ")) \\ G. C. Greubel, Dec 29 2017 (Magma) [n + Floor(n*Sinh(1)) + Floor(n*Tanh(1)): n in [1..30]]; // G. C. Greubel, Dec 29 2017 CROSSREFS Cf. A190304, A190306. Sequence in context: A140101 A141207 A190057 * A294391 A257771 A276881 Adjacent sequences: A190302 A190303 A190304 * A190306 A190307 A190308 KEYWORD nonn AUTHOR Clark Kimberling, May 07 2011 EXTENSIONS Definition corrected by Georg Fischer, Jun 10 2020 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 January 30 07:41 EST 2023. Contains 359941 sequences. (Running on oeis4.)