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.
%I A185543 #23 Sep 17 2024 12:33:54
%S A185543 3,4,6,7,9,10,12,13,15,16,17,19,20,21,23,24,25,26,28,29,30,32,33,34,
%T A185543 35,37,38,39,40,42,43,44,45,47,48,49,50,51,53,54,55,56,57,59,60,61,62,
%U A185543 63,65,66,67,68,69,71,72,73,74,75,77,78,79,80,81,83,84,85,86,87,88,90
%N A185543 Numbers not of the form floor(k^(3/2)); complement of A000093.
%H A185543 G. C. Greubel, <a href="/A185543/b185543.txt">Table of n, a(n) for n = 1..5000</a>
%H A185543 Chai Wah Wu, <a href="https://arxiv.org/abs/2409.05844">Algorithms for complementary sequences</a>, arXiv:2409.05844 [math.NT], 2024.
%t A185543 f[n_]=Floor[n^(3/2)]
%t A185543 t1=Table[f[n],{n,1,80}];t1 (* A000093 *)
%t A185543 t2=Complement[Range[200], Table[f[n],{n,1,80}]];t2 (* A185543 *)
%o A185543 (Python)
%o A185543 def A185543(n):
%o A185543 def f(x): return n-1+(a:=integer_nthroot((x+1)**2,3))[0]+(a[1]^1)
%o A185543 m, k = n, f(n)
%o A185543 while m != k: m, k = k, f(k)
%o A185543 return m # _Chai Wah Wu_, Sep 10 2024
%Y A185543 Cf. A000093.
%K A185543 nonn
%O A185543 1,1
%A A185543 _Clark Kimberling_, Jan 30 2011