cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A184871 n+floor(ns/r)+floor(nt/r), where r=log(2), s=log(3), t=log(5).

Original entry on oeis.org

4, 9, 13, 19, 23, 28, 34, 38, 43, 48, 53, 58, 63, 68, 72, 78, 82, 87, 93, 97, 102, 107, 112, 117, 122, 127, 131, 137, 141, 146, 151, 156, 161, 165, 171, 176, 180, 186, 190, 195, 200, 205, 210, 215, 220, 224, 230, 235, 239, 245, 249, 254, 260, 264, 269, 274, 279, 283, 288, 294, 298, 303, 308, 313, 318, 323, 328, 332, 338, 342, 347, 353, 357, 362, 367, 372, 377, 382, 387, 391, 397, 401, 406, 412, 416, 421, 426, 431, 436, 440, 446, 450, 455, 460, 465, 470, 475, 480, 484, 490, 495, 499, 505, 509, 514, 520, 524, 529, 534, 539, 543, 549, 554, 558, 564, 568, 573, 578, 583, 588
Offset: 1

Views

Author

Clark Kimberling, Jan 23 2011

Keywords

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 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=log(2), s=log(3), t=log(5) yields
a=A184871, b=A184872, c=A184873.

Crossrefs

Cf. A184812, A184872, A184873, A184874 (primes in A184872).

Programs

  • Mathematica
    r=Log[2]; s=Log[3]; t=Log[5];
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}]  (* A184871 *)
Table[b[n],{n,1,120}]  (* A184872 *)
Table[c[n],{n,1,120}]  (* A184873 *)

Extensions

Name corrected by Charles R Greathouse IV, Sep 04 2015

A184876 Numbers m such that prime(m) is of the form k+floor(kr/t)+floor(ks/t), where r=log(2), s=log(3), t=log(5).

Original entry on oeis.org

2, 4, 10, 11, 12, 13, 15, 17, 20, 21, 22, 27, 29, 30, 34, 35, 41, 42, 44, 46, 47, 48, 49, 50, 51, 54, 55, 56, 63, 67, 68, 72, 74, 75, 80, 81, 86, 87, 93, 98, 99, 102, 103, 105, 108, 109, 110, 114, 115, 116, 122, 127, 128, 132, 138, 141, 142, 143, 144, 148, 149, 153, 158, 163, 164, 168, 169, 170, 173, 177, 181, 182, 184, 186, 187, 190, 191, 195, 196, 199, 200, 201, 202
Offset: 1

Views

Author

Clark Kimberling, Jan 23 2011

Keywords

Comments

See A184871 and A184874.

Crossrefs

Cf. A184871, A184874, A184876.

Programs

A184875 Numbers m such that prime(m) is of the form k+floor(kr/s)+floor(kt/s), where r=log(2), s=log(3), t=log(5).

Original entry on oeis.org

1, 3, 5, 7, 18, 19, 23, 24, 26, 37, 38, 39, 40, 43, 45, 53, 58, 59, 60, 62, 64, 66, 70, 76, 77, 84, 85, 88, 89, 90, 91, 92, 94, 96, 100, 101, 104, 106, 107, 117, 119, 120, 123, 124, 129, 130, 131, 133, 134, 135, 137, 139, 145, 150, 152, 157, 159, 161, 162, 165, 166, 172, 174, 175, 178, 188, 189, 192, 198, 203, 204, 205, 208, 216, 217, 218, 219, 222, 224, 226, 227, 228, 230, 245, 246, 254, 257, 258, 264, 266, 269, 270, 279, 280, 283
Offset: 1

Views

Author

Clark Kimberling, Jan 23 2011

Keywords

Comments

See A184871 and A184874.

Crossrefs

Cf. A184871, A184874, A184876.

Programs

Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.