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