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 A075847 #19 Mar 07 2022 15:46:54
%S A075847 0,0,3,1,8,17,9,22,0,17,36,57,19,44,71,9,40,73,108,18,57,98,141,17,64,
%T A075847 113,164,0,55,112,171,232,24,89,156,225,296,38,113,190,269,350,36,121,
%U A075847 208,297,388,12,107,204,303,404,507,65,172,281,392,505,620,106,225,346
%N A075847 Difference between n^2 and the largest cube <= n^2.
%C A075847 a(n) = n^2 - A077106(n).
%C A075847 a(n) = 0 iff n = m^(6*k).
%C A075847 a(n) = 0 when n is a cube. See A070923.
%H A075847 Zak Seidov, <a href="/A075847/b075847.txt">Table of n, a(n) for n = 0..2000</a>
%e A075847 a(4)=8 because 4^2 - 2^3 = 8; a(9)=17 because 9^2 - 4^3 = 17.
%e A075847 A077106(20) = 343 = 7^3 is the largest cube <= 20^2 = 400, therefore a(20) = 400 - 343 = 57.
%t A075847 Table[a = n^2; a - Floor[a^(1/3)]^3, {n, 0, 300}] (* _Vladimir Joseph Stephan Orlovsky_, Jun 03 2011 *)
%Y A075847 Cf. A000290, A070923, A077110, A077111, A077116.
%Y A075847 Cf. A070923.
%K A075847 easy,nonn
%O A075847 0,3
%A A075847 _Zak Seidov_ and _Reinhard Zumkeller_, Oct 15 2002
%E A075847 Edited by _N. J. A. Sloane_ at the suggestion of _Zak Seidov_, Oct 30 2008