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 A219963 #9 Dec 04 2012 14:11:45 %S A219963 2897,3159,3183,4004,6335,7025,8163,8237,8621,9234,12204,12963,13381, %T A219963 14340,15217,16191,16438,17474,17763,17972,18065,18990,19677,19848, %U A219963 20345,20803,21426,21539,22022,25834,26872,27175,28052,28929,28996,29295,30511,30991 %N A219963 Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))^2) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))^2 - y). %C A219963 Intersection of A219303 and A219960. %C A219963 Like the parent sequences, this sequence has pairs of consecutive integers; The first of these pairs is 89971 and 89972. %C A219963 It is possible, assuming the infinite-pairs conjectures are true for both parent sequences, that there may also be an infinite number of pairs here, but even then that is not guaranteed. %H A219963 Carl R. White, <a href="/A219963/b219963.txt">Table of n, a(n) for n = 1..10000</a> %Y A219963 Cf. A219303, A219960. %K A219963 nonn %O A219963 1,1 %A A219963 _Carl R. White_, Dec 02 2012