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 A216155 #13 Sep 26 2014 13:31:41 %S A216155 2,13,40,43,46,52,109,152,190,243,336,351,356,366,422,584,592,741,937, %T A216155 978,1011,1040,1137,1330,1355,1362,1376,1398,1434,2063,2320,2520,2553, %U A216155 2660,2665,2928,2940,2993,3067,3075,3092,3296,3532,3631,3703,3712,3730 %N A216155 Numbers n such that floor(sqrt(n + n^3)) = 1 + floor(sqrt(n^3)) = 1 + A000093(n). %C A216155 The sequence is infinite. For values of n not in the sequence we have floor(sqrt(n+n^3)) = floor(sqrt(n^3)) = A000093(n). %H A216155 Reinhard Zumkeller, <a href="/A216155/b216155.txt">Table of n, a(n) for n = 1..1000</a> %t A216155 Select[Range[10000], Floor[Sqrt[# + #^3]] - Floor[Sqrt[#^3]] == 1 &] %o A216155 (Haskell) %o A216155 a216155 n = a216155_list !! (n-1) %o A216155 a216155_list = filter %o A216155 (\x -> a000196 (a034262 x) == a000196 (a000578 x) + 1) [1..] %o A216155 -- _Reinhard Zumkeller_, Sep 26 2014 %Y A216155 Cf. A000093 (floor(n^(3/2))). %Y A216155 Cf. A000196, A000578, A034262, A247628 (subsequence). %K A216155 nonn %O A216155 1,1 %A A216155 _Zak Seidov_, Sep 02 2012