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 A060803 #31 Sep 25 2023 13:54:47
%S A060803 2,6,22,278,65814,4295033110,18446744078004584726,
%T A060803 340282366920938463481821351509772796182,
%U A060803 115792089237316195423570985008687907853610267032561502502939405359422902436118
%N A060803 a(n) = Sum_{k=0..n} 2^(2^k).
%C A060803 Partial sums of A001146.
%C A060803 Number of Boolean functions with up to n arguments. - Paul Tarau (paul.tarau(AT)gmail.com), Jun 06 2008
%H A060803 Harry J. Smith, <a href="/A060803/b060803.txt">Table of n, a(n) for n = 0..11</a>
%H A060803 Paul Tarau, <a href="http://www.cse.unt.edu/~tarau/research/2009/fISO.pdf">Isomorphic Data Encodings and their Generalization to Hylomorphisms on Hereditarily Finite Data Types</a>, 2009.
%F A060803 a(0) = 2 and a(n) - a(n-1) = 2^2^n, n > 0.
%e A060803 a(3) = 278 because a(3) = 2^2^0 + 2^2^1 + 2^2^2 + 2^2^3 = 2 + 4 + 16 + 256.
%t A060803 Accumulate[2^(2^Range[0,10])] (* _Harvey P. Dale_, Sep 25 2023 *)
%o A060803 (Haskell) -- code generating the infinite sequence:
%o A060803 scanl (+) 2 (map (\x->2^2^x) [1..]) - Paul Tarau (paul.tarau(AT)gmail.com), Jun 06 2008
%o A060803 (PARI) { for (n=0, 11, write("b060803.txt", n, " ", sum(k=0, n, 2^(2^k))); ) } \\ _Harry J. Smith_, Jul 12 2009
%Y A060803 Cf. A001146, A001147, A115245.
%K A060803 nonn
%O A060803 0,1
%A A060803 Varol Akman (akman(AT)cs.bilkent.edu.tr), Apr 28 2001
%E A060803 More terms from _Benoit Cloitre_, May 13 2002
%E A060803 Edited by _N. J. A. Sloane_, Jun 07 2008