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 #10 Mar 12 2015 23:36:00
%S 0,1,2,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,703,704,705,
%T 706,707,708,709,710,711,712,713,714,715,716,717,718,719,720,721,722,
%U 723,724,725,726,727,728,729,730,731,732,733,734,735,736,737,738,739
%N Numbers such that (closest square) = (closest cube).
%C A061023(a(n)) = 0; A053187(a(n)) = A201053(a(n));
%C A001014 is a subsequence (6th powers).
%H Reinhard Zumkeller, <a href="/A201217/b201217.txt">Table of n, a(n) for n = 1..6051</a>
%o (Haskell)
%o import Data.List (elemIndices)
%o a201217 n = a201217_list !! (n-1)
%o a201217_list = elemIndices 0 a061023_list
%o -- _Reinhard Zumkeller_, Nov 28 2011
%K nonn
%O 1,3
%A _Reinhard Zumkeller_, Nov 28 2011