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 A273319 #11 May 20 2016 13:35:31
%S A273319 2,2,14,150,2362,49210,1280582,40045166,1464047858,61310662578,
%T A273319 2894855376382,152184891889030,8817255144288554,558260148630165098,
%U A273319 38351949989325264182,2841496569324942436830
%N A273319 a(n) = ((2*n+1)^(n+1) + (-1)^n)/(n+1)^2.
%C A273319 When searching for the smallest k such that n^k + 1 is not squarefree, I noticed that if n is even then n^(n+1) + 1 is not squarefree, and if n is of the form 4*j + 1 (j>0) then n^((n+1)/2) + 1 is not squarefree.
%F A273319 a(n) = Sum_{k = 0..n} (-1)^(n - k)*2^(k+1)*(n+1)^(k-1)*C(n+1, n - k).
%t A273319 Table[((2n + 1)^(n + 1) + (-1)^n)/(n + 1)^2, {n, 0, 15}] (* _Alonso del Arte_, May 19 2016 *)
%Y A273319 Cf. A081215.
%K A273319 nonn,easy
%O A273319 0,1
%A A273319 _Gionata Neri_, May 19 2016