login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A190304
a(n) = n + [n*s/r] + [n*t/r]; r=1, s=csch(1), t=sech(1).
3
1, 4, 6, 9, 12, 14, 16, 19, 21, 24, 27, 29, 32, 34, 36, 39, 42, 44, 47, 49, 51, 54, 56, 59, 62, 64, 66, 69, 71, 74, 77, 79, 82, 84, 86, 89, 91, 94, 97, 99, 101, 104, 106, 109, 112, 114, 116, 119, 121, 124, 127, 129, 132, 133, 136, 139, 141, 144, 147, 149, 151, 154, 156, 159, 162, 164, 167, 169, 171, 174, 177, 179, 182, 183, 186, 189
OFFSET
1,2
COMMENTS
This is one of three sequences that partition the positive integers. In general, suppose that r, s, t are positive real numbers for which the sets {i/r: i>=1}, {j/s: j>=1}, {k/t: k>=1} are pairwise disjoint. Let a(n) be the rank of n/r when all the numbers in the three sets are jointly ranked. Define b(n) and c(n) as the ranks of n/s and n/t. It is easy to prove that
a(n) = n+[ns/r]+[nt/r],
b(n) = n+[nr/s]+[nt/s],
c(n) = n+[nr/t]+[ns/t], where []=floor.
Taking r=1, s=csch(1), t=sech(1) gives
LINKS
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/cosh(1)), ", ")) \\ G. C. Greubel, Dec 29 2017
(Magma) [n + Floor(n/Sinh(1)) + Floor(n/Cosh(1)): n in [1..30]]; // G. C. Greubel, Dec 29 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 07 2011
STATUS
approved