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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Sep 28 2017 08:34:19
%S 1,2,4,6,7,9,11,12,14,16,18,19,21,23,24,26,28,29,31,33,34,37,38,39,41,
%T 43,44,46,48,50,51,53,55,56,58,60,61,63,65,66,69,70,71,74,75,76,78,80,
%U 82,83,85,87,88,90,92,93,95,97,98,101,102,103,106,107,108
%N Rank of n when all the numbers h, j*e, k*Pi, for h>=1, j>=1, k>=1, are jointly ranked.
%C This sequence and A292655 and A292656 partition the set of positive integers.
%H Clark Kimberling, <a href="/A292654/b292654.txt">Table of n, a(n) for n = 1..1000</a>
%t z = 120; r = 1; s = E; t = Pi;
%t Table[n + Floor[n*r/s] + Floor[n*r/t], {n, 1, z}] (* A292654 *)
%t Table[n + Floor[n*s/r] + Floor[n*s/t], {n, 1, z}] (* A292655 *)
%t Table[n + Floor[n*t/r] + Floor[n*t/s], {n, 1, z}] (* A292656 *)
%Y Cf. A292655, A292656.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Sep 27 2017