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.

A186147 Rank of n^3 when {i^2: i>=1} and {j^3: j>=1} are jointly ranked with i^2 after j^3 when i^2=j^3. Complement of A135674.

This page as a plain text file.
%I A186147 #6 Aug 19 2022 14:48:15
%S A186147 1,4,8,11,16,20,25,30,35,41,47,53,59,66,73,79,87,94,101,109,117,125,
%T A186147 133,141,149,158,167,176,185,194,203,213,222,232,242,251,262,272,282,
%U A186147 292,303,314,324,335,346,357,369,380,391,403,415,426,438,450,462,475,487,499,512,524,537,550,563,575,589,602,615,628,642,655,669,682,696,710,724,738,752,766,781,795,809,824,839,853,868,883,898,913
%N A186147 Rank of n^3 when {i^2: i>=1} and {j^3: j>=1} are jointly ranked with i^2 after j^3 when i^2=j^3. Complement of A135674.
%C A186147 See A186145.
%F A186147 b(n):=n+floor((n^3-1/2)^(1/2)), as in the Mathematica program.
%t A186147 d=-1/2;
%t A186147 a[n_]:=n+Floor[(n^2-d)^(1/3)]; (* rank of n^2 *)
%t A186147 b[n_]:=n+Floor[(n^3+d)^(1/2)]; (* rank of n^3-1/2 *)
%t A186147 Table[a[n],{n,1,100}]  (* A135674 *)
%t A186147 Table[b[n],{n,1,100}]  (* A186147 *)
%Y A186147 Cf. A135674, A186145.
%K A186147 nonn
%O A186147 1,2
%A A186147 _Clark Kimberling_, Feb 13 2011