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.

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

Original entry on oeis.org

2, 5, 8, 11, 15, 17, 21, 24, 27, 30, 33, 36, 40, 42, 45, 49, 51, 55, 57, 61, 64, 67, 70, 74, 76, 80, 83, 86, 89, 91, 95, 98, 101, 104, 108, 110, 114, 116, 120, 123, 126, 129, 132, 135, 138, 142, 144, 148, 150, 154, 157, 160, 163, 167, 169, 173, 175, 178, 182, 184, 188, 191, 194, 197, 201, 203, 207, 209, 213, 216, 219, 222, 225, 228, 231, 234, 237, 241, 243, 247, 250, 253, 256, 259, 262, 265, 268, 271, 275, 277, 281, 284, 287, 290, 293, 296, 300, 302, 306, 309, 311, 315, 317, 321, 324, 327, 330, 334, 336, 340, 343, 346, 349, 352, 355, 358, 361, 364, 368, 370
Offset: 1

Views

Author

Clark Kimberling, Jan 23 2011

Keywords

Comments

See A184871.

Crossrefs

Cf. A184871, A184873, A184875 (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 *)