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 A155499 #16 Feb 20 2016 06:18:56
%S A155499 1,9,83,1027,15629,279941,5764807,134217735,3486784409,100000000009,
%T A155499 3138428376731,106993205379083,3937376385699301,155568095557812237,
%U A155499 6568408355712890639,295147905179352825871
%N A155499 a(n) = n + (n+1)^(n+2).
%C A155499 All the terms are evidently odd. If n is even, a(n) is (n+1) mod 8; if n is odd, a(n) is n mod 8.
%C A155499 Thus the sequence of remainders by dividing a(n) by 8 is given by 1, 1, 3, 3, 5, 5, 7, 7, 1, 1...
%H A155499 Vincenzo Librandi, <a href="/A155499/b155499.txt">Table of n, a(n) for n = 0..200</a>
%e A155499 If n=2, a(2)=2+3^4=83.
%t A155499 Table[n +(n+1)^(n+2),{n,20}] (* or *) #[[1]]+#[[2]]^#[[3]]&/@ Partition[ Range[20],3,1] (* _Harvey P. Dale_, Mar 14 2012 *)
%o A155499 (PARI) a(n) = n+(n+1)^(n+2); \\ _Michel Marcus_, Feb 20 2016
%K A155499 nonn
%O A155499 0,2
%A A155499 Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 23 2009
%E A155499 Added the first term 1 by _Vincenzo Librandi_, Mar 15 2012