The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A292644 Rank of (6-r)*n when all the numbers (6-r)*j and (6+r)*k, where r = sqrt(2), j>=1, k>=1, are jointly ranked. 2

%I

%S 1,3,4,6,8,9,11,12,14,16,17,19,21,22,24,25,27,29,30,32,33,35,37,38,40,

%T 42,43,45,46,48,50,51,53,55,56,58,59,61,63,64,66,67,69,71,72,74,76,77,

%U 79,80,82,84,85,87,89,90,92,93,95,97,98,100,101,103,105

%N Rank of (6-r)*n when all the numbers (6-r)*j and (6+r)*k, where r = sqrt(2), j>=1, k>=1, are jointly ranked.

%H Clark Kimberling, <a href="/A292644/b292644.txt">Table of n, a(n) for n = 1..1000</a>

%t z = 120; r = 6 - Sqrt[2]; s = 6 + Sqrt[2];

%t Table[n + Floor[n*r/s], {n, 1, z}] (* A292644 *)

%t Table[n + Floor[n*s/r], {n, 1, z}] (* A292645 *)

%o (PARI) vector(100, n, n+floor(n*(6-sqrt(2))/(6+sqrt(2)))) \\ _G. C. Greubel_, Aug 20 2018

%o (MAGMA) [n+Floor(n*(6-Sqrt(2))/(6+Sqrt(2))): n in [1..100]]; // _G. C. Greubel_, Aug 20 2018

%Y Cf. A292645 (complement).

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Sep 26 2017

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

Last modified November 30 09:54 EST 2021. Contains 349419 sequences. (Running on oeis4.)