The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186154 Rank of (1/8)n^3 when {(1/8)i^3: i>=1} and {j^2>: j>=1} are jointly ranked with (1/8)i^3 after j^2 when (1/8)i^3=j^2. Complement of A186155. 3
 1, 3, 4, 6, 8, 11, 13, 16, 18, 21, 23, 26, 29, 32, 35, 38, 41, 45, 48, 51, 55, 58, 61, 65, 69, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 125, 129, 133, 138, 142, 147, 151, 156, 160, 165, 170, 175, 179, 184, 189, 194, 199, 204, 209, 214, 219, 224, 229, 234, 239, 245, 250, 255, 260, 266, 271, 277, 282, 288, 293, 299, 304, 310, 315, 321, 327, 332, 338, 344, 350, 356, 362, 367, 373, 379, 385, 391, 397, 403, 410 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A186154 results from changing "before" to "after" in the name of A186152. See A186145 for a discussion of adjusted joint rank sequences. LINKS Table of n, a(n) for n=1..93. MATHEMATICA d=-1/16; u=1/8; v=1; p=3; q=2; h[n_]:=((u*n^p-d)/v)^(1/q); a[n_]:=n+Floor[h[n]]; (* rank of u*n^p *) k[n_]:=((v*n^q+d)/u)^(1/p); b[n_]:=n+Floor[k[n]]; (* rank of v*n^q *) Table[a[n], {n, 1, 100}] (* A186154 *) Table[b[n], {n, 1, 100}] (* A186155 *) CROSSREFS Cf. A186145, A186155. Sequence in context: A020901 A181714 A057057 * A030711 A030761 A060903 Adjacent sequences: A186151 A186152 A186153 * A186155 A186156 A186157 KEYWORD nonn AUTHOR Clark Kimberling, Feb 13 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 22:36 EST 2023. Contains 367616 sequences. (Running on oeis4.)