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 A054874 #4 Mar 30 2012 18:51:25 %S A054874 0,1,2,8,2048 %N A054874 a(n) = 2^(sum of a(i) where i<n). %C A054874 The next term is too large to include. %F A054874 a(n) = 2^A034797(n-1) = A034797(n) - A034797(n-1) %e A054874 a(4) = 2^(0+1+2+8) = 2^11 = 2048; a(5) = 2^2059>10^619 %Y A054874 Cf. A014221, A034797 for partial sum, so a(n) is number of impartial games with value n-1, using natural enumeration of impartial games. %K A054874 easy,nonn %O A054874 0,3 %A A054874 _Henry Bottomley_, May 26 2000