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.

A184916 n+[sn/r]+[tn/r]+[un/r], where []=floor and r=1, s=2^(1/4), t=s^2, u=s^3.

Original entry on oeis.org

4, 9, 15, 19, 25, 31, 35, 41, 46, 51, 57, 62, 67, 72, 78, 83, 89, 94, 98, 104, 109, 115, 120, 125, 131, 135, 142, 147, 152, 157, 162, 168, 173, 179, 183, 188, 195, 199, 205, 210, 214, 220, 226, 231, 236, 242, 247, 252, 258, 263, 268, 273, 279, 284, 289, 295, 299, 305, 311, 315, 321, 326, 331, 337, 342, 347, 352, 358, 364, 368, 374, 379, 384, 390, 396, 400, 405, 411, 415, 422, 427, 431, 437, 442, 448, 453, 459, 463, 468, 475, 480, 485, 490, 495, 500, 506, 512, 516, 522, 527, 532, 538, 543, 548, 553, 559, 564, 569, 575, 579, 585, 591, 596, 601, 606, 612, 617, 622, 628, 632
Offset: 1

Views

Author

Clark Kimberling, Jan 26 2011

Keywords

Comments

The sequences A184916-A184919 partition the positive integers:
A184916: 4,9,15,19,25,31,35,41,...
A184917: 3,7,12,16,21,26,29,34,...
A184918: 2,6,10,13,17,22,24,28,...
A184919: 1,5,8,11,14,18,20,23,27,...
The joint ranking method of A184812 is extended here to four numbers r,s,t,u, as follows: jointly rank the sets {h*r}, {i*s}, {j*t}, {k*u}, h>=1, i>=1, j>=1, k>=1.
The position of n*r in the joint ranking is
n+[sn/r]+[tn/r]+[un/r], and likewise for the
positions of n*s, n*t, and n*u.

Crossrefs

Cf. A184912, A184917, A184918, A184919.

Programs

  • Mathematica
    r=1; s=2^(1/4); t=2^(1/2); u=2^(3/4);
a[n_]:=n+Floor[n*s/r]+Floor[n*t/r]+Floor[n*u/r];
b[n_]:=n+Floor[n*r/s]+Floor[n*t/s]+Floor[n*u/s];
c[n_]:=n+Floor[n*r/t]+Floor[n*s/t]+Floor[n*u/t];
d[n_]:=n+Floor[n*r/u]+Floor[n*s/u]+Floor[n*t/u];
Table[a[n],{n,1,120}]  (* A184916 *)
Table[b[n],{n,1,120}]  (* A184917 *)
Table[c[n],{n,1,120}]  (* A184918 *)
Table[d[n],{n,1,120}]  (* A184919 *)

Formula

a(n)=n+[sn/r]+[tn/r]+[un/r], where []=floor and
r=1, s=2^(1/4), t=s^2, u=s^3.

A184918 n+[rn/t]+[sn/t]+[un/t], where []=floor and r=1, s=2^(1/4), t=s^2, u=s^3.

Original entry on oeis.org

2, 6, 10, 13, 17, 22, 24, 28, 32, 36, 40, 44, 47, 50, 54, 59, 63, 66, 69, 73, 76, 81, 85, 88, 92, 95, 100, 103, 107, 111, 114, 118, 122, 126, 129, 133, 138, 140, 144, 148, 151, 155, 160, 163, 166, 170, 174, 178, 182, 186, 189, 192, 197, 201, 204, 208, 211, 215, 219, 223, 227, 230, 233, 238, 241, 245, 249, 253, 257, 260, 264, 267, 271, 276, 280, 282, 286, 290, 293, 298, 302, 304, 308, 312, 317, 320, 324, 327, 330, 335, 339, 343, 346, 350, 353, 357, 361, 365, 369, 372, 376, 380, 383, 387, 391, 395, 398, 402, 406, 409, 414, 418, 421, 424, 428, 432, 436, 440, 444, 446
Offset: 1

Views

Author

Clark Kimberling, Jan 26 2011

Keywords

Comments

The sequences A184916-A184919 partition the positive integers:
A184916: 4,9,15,19,25,31,35,41,...
A184917: 3,7,12,16,21,26,29,34,...
A184918: 2,6,10,13,17,22,24,28,...
A184919: 1,5,8,11,14,18,20,23,27,...
The joint ranking method of A184812 is extended here to four numbers r,s,t,u, as follows: jointly rank the sets {h*r}, {i*s}, {j*t}, {k*u}, h>=1, i>=1, j>=1, k>=1.
The position of n*t in the joint ranking is
n+[rn/t]+[sn/t]+[un/t], and likewise for the
positions of n*r, n*s, and n*u.

Crossrefs

Cf. A184912, A184916, A184917, A184919.

Programs

  • Mathematica
    r=1; s=2^(1/4); t=2^(1/2); u=2^(3/4);
a[n_]:=n+Floor[n*s/r]+Floor[n*t/r]+Floor[n*u/r];
b[n_]:=n+Floor[n*r/s]+Floor[n*t/s]+Floor[n*u/s];
c[n_]:=n+Floor[n*r/t]+Floor[n*s/t]+Floor[n*u/t];
d[n_]:=n+Floor[n*r/u]+Floor[n*s/u]+Floor[n*t/u];
Table[a[n],{n,1,120}]  (* A184916 *)
Table[b[n],{n,1,120}]  (* A184917 *)
Table[c[n],{n,1,120}]  (* A184918 *)
Table[d[n],{n,1,120}]  (* A184919 *)

A184919 n+[rn/u]+[sn/u]+[tn/u], where []=floor and r=1, s=2^(1/4), t=s^2, u=s^3.

Original entry on oeis.org

1, 5, 8, 11, 14, 18, 20, 23, 27, 30, 33, 37, 39, 42, 45, 49, 53, 55, 58, 61, 64, 68, 71, 74, 77, 80, 84, 86, 90, 93, 96, 99, 102, 106, 108, 112, 116, 117, 121, 124, 127, 130, 134, 137, 139, 143, 146, 149, 153, 156, 159, 161, 165, 169, 171, 175, 177, 181, 184, 187, 191, 193, 196, 200, 202, 206, 209, 213, 216, 218, 222, 224, 228, 232, 235, 237, 240, 244, 246, 250, 254, 255, 259, 262, 266, 269, 272, 275, 277, 281, 285, 288, 291, 294, 297, 300, 303, 307, 310, 313, 316, 319, 322, 325, 329, 332, 334, 338, 341, 344, 348, 351, 354, 356, 360, 363, 366, 370, 373, 375
Offset: 1

Views

Author

Clark Kimberling, Jan 26 2011

Keywords

Comments

The sequences A184916-A184919 partition the positive integers:
A184916: 4,9,15,19,25,31,35,41,...
A184917: 3,7,12,16,21,26,29,34,...
A184918: 2,6,10,13,17,22,24,28,...
A184919: 1,5,8,11,14,18,20,23,27,...
The joint ranking method of A184812 is extended here to four numbers r,s,t,u, as follows: jointly rank the sets {h*r}, {i*s}, {j*t}, {k*u}, h>=1, i>=1, j>=1, k>=1.
The position of n*u in the joint ranking is
n+[rn/u]+[sn/u]+[tn/u], and likewise for the
positions of n*r, n*s, and n*t.

Crossrefs

Cf. A184912, A184916, A184917, A184918.

Programs

  • Mathematica
     r=1; s=2^(1/4); t=2^(1/2); u=2^(3/4);
a[n_]:=n+Floor[n*s/r]+Floor[n*t/r]+Floor[n*u/r];
b[n_]:=n+Floor[n*r/s]+Floor[n*t/s]+Floor[n*u/s];
c[n_]:=n+Floor[n*r/t]+Floor[n*s/t]+Floor[n*u/t];
d[n_]:=n+Floor[n*r/u]+Floor[n*s/u]+Floor[n*t/u];
Table[a[n],{n,1,120}]  (* A184916 *)
Table[b[n],{n,1,120}]  (* A184917 *)
Table[c[n],{n,1,120}]  (* A184918 *)
Table[d[n],{n,1,120}]  (* A184919 *)
Table[With[{s=Surd[2,4]},n+Floor[n/s^3]+Floor[(n*s)/s^3]+Floor[(n*s^2)/s^3]],{n,120}] (* Harvey P. Dale, Dec 01 2024 *)
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.