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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276220 Position of n^s in the joint ranking of {h} and {k^s}, where s = sqrt(2), h >= 1, k >= 2. 3
 1, 2, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 35, 36, 37, 38, 40, 41, 42, 43, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 66, 67, 68, 69, 71, 72, 73, 74, 75, 77, 78, 79, 80, 81, 83, 84 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 FORMULA a(n) = n + floor(n^s), n >= 1; the complement is given by n + floor(n^(1/s)), n >= 2. EXAMPLE The first numbers in the joint ranking are 1^r < 2^r < 2^s < 3^r < 4^r < 3^s < 5^r < 6^r < 7^r < 4^s, so that a(n) = (1, 2, 4, 5, 7,...). MATHEMATICA z = 150; s = N[Sqrt[2], 100]; u = Table[n + Floor[n^s], {n, 2, z}]; v = Table[n + Floor[n^(1/s)], {n, 1, z^s}]; w = Union[u, v]; Flatten[Table[Position[w, u[[n]]], {n, 1, z}]] (* A276219 *) Flatten[Table[Position[w, v[[n]]], {n, 1, z}]] (* A276220 *) CROSSREFS Cf. A276219 (complement). Sequence in context: A183862 A254058 A346128 * A288204 A047381 A286428 Adjacent sequences: A276217 A276218 A276219 * A276221 A276222 A276223 KEYWORD nonn,easy AUTHOR Clark Kimberling, Sep 06 2016 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 2 15:00 EST 2022. Contains 358510 sequences. (Running on oeis4.)