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.

A356089 a(n) = A001951(A054406(n)).

Original entry on oeis.org

2, 5, 9, 12, 15, 19, 22, 25, 29, 32, 36, 39, 42, 46, 49, 52, 56, 59, 62, 66, 69, 73, 76, 79, 83, 86, 89, 93, 96, 98, 103, 106, 110, 113, 115, 120, 123, 125, 130, 132, 137, 140, 142, 147, 149, 152, 156, 159, 162, 166, 169, 173, 176, 179, 183, 186, 189, 193
Offset: 1

Views

Author

Clark Kimberling, Aug 04 2022

Keywords

Comments

This is the second of four sequences that partition the positive integers. See A356088.

Examples

			(1)  u o v   = (1,  4,  7,  8, 11, 14, 16, 18, 21, 24, 26, ...) = A356088.
(2)  u o v'  = (2,  5,  9, 12, 15, 19, 22, 25, 29, 32, 36, ...) = A356089.
(3)  u' o v  = (3, 10, 17, 20, 27, 34, 40, 44, 51, 58, 64, ...) = A356090.
(4)  u' o v' = (6, 13, 23, 30, 37, 47, 54, 61, 71, 78, 88, ...) = A356091.
		

Crossrefs

Cf. A001951, A001952, A022838, A054406, A346308 (intersections instead of results of composition), A356088, A356090, A356091.

Programs

  • Mathematica
    z = 600; zz = 100;
    u = Table[Floor[n*Sqrt[2]], {n, 1, z}];  (* A001951 *)
    u1 = Complement[Range[Max[u]], u];  (* A001952 *)
    v = Table[Floor[n*Sqrt[3]], {n, 1, z}];  (* A022838 *)
    v1 = Complement[Range[Max[v]], v];  (* A054406 *)
    Table[u[[v[[n]]]], {n, 1, zz}]    (* A356088 *)
    Table[u[[v1[[n]]]], {n, 1, zz}]   (* A356089 *)
    Table[u1[[v[[n]]]], {n, 1, zz}]   (* A356090 *)
    Table[u1[[v1[[n]]]], {n, 1, zz}]  (* A356091 *)