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 A232395 #32 Jun 11 2014 21:18:21 %S A232395 0,0,1,9,15,13,30,0,40,21,45,57,51,21,70,105,120,109,66,156,43,77,81, %T A232395 49,216,108,217,9,36,21,293,192,31,189,309,385,411,381,289,129,408, %U A232395 112,281,396,451,440,357,196,624,309,613,120,276,360,366,288,120,725 %N A232395 (ceiling(sqrt(n^3 + n^2 + n + 1)))^2 - (n^3 + n^2 + n + 1). %C A232395 a(n)=0, iff 1 + n + n^2 + n^3 is a perfect square. For example, a(7)=0 and we have 1 + 7 + 7^2 + 7^3 = 20^2. %C A232395 a(n) = Difference between smallest square >= (n^3 + n^2 + n + 1) and (n^3 + n^2 + n + 1) - _Antti Karttunen_, Nov 27 2013 %H A232395 Ivan Panchenko, <a href="/A232395/b232395.txt">Table of n, a(n) for n = 0..1000</a> %F A232395 Contribution from _Antti Karttunen_, Nov 27 2013: (Start) %F A232395 a(n) = A000290(⌈sqrt(A053698(n))⌉) - A053698(n). Where ⌈x⌉ stands for ceiling(x). This further reduces as: %F A232395 a(n) = A000290(A135034(A053698(n))) - A053698(n). %F A232395 a(n) = A048761(A053698(n)) - A053698(n). %F A232395 a(n) = A068527(A053698(n)). %F A232395 (End) %o A232395 (PARI) a(n) = ceil(sqrt(n^3+n^2+n+1))^2 - (n^3+n^2+n+1); \\ _Michel Marcus_, Nov 23 2013 %Y A232395 Cf. A053698, A068527. %K A232395 nonn %O A232395 0,4 %A A232395 _Vladimir Shevelev_, Nov 23 2013 %E A232395 More terms from _Peter J. C. Moses_