proposed
approved
proposed
approved
editing
proposed
b[n_] := b[n] = If[n == 0, 1, b[n - 1]^2 + 2^(2^(n - 1) - 1)];
a[n_] := Function[l, Product[If[l[[i]] == 1, b[i], 1], {i, 1, Length[l]}]][ Reverse @ IntegerDigits[n, 2]];
a /@ Range[0, 35] (* Jean-François Alcover, Apr 10 2020, after Alois P. Heinz *)
approved
editing
editing
approved
Alois P. Heinz, <a href="/A332868/b332868.txt">Table of n, a(n) for n = 0..2412</a>
approved
editing
editing
approved
b:= proc(n) b(n):=`if`(n=0, 1, b(n-1)^2+2^(2^(n-1)-1)) end:
a:= n-> (l-> mul(`if`(l[i]=1, b(i), 1), i=1..nops(l)))(Bits[Split](n)):
seq(a(n), n=0..35); # Alois P. Heinz, Feb 27 2020
proposed
editing
editing
proposed
1, 2, 6, 12, 44, 88, 264, 528, 2064, 4128, 12384, 24768, 90816, 181632, 544896, 1089792, 4292864, 8585728, 25757184, 51514368, 188886016, 377772032, 1133316096, 2266632192, 8860471296, 17720942592, 53162827776, 106325655552, 389860737024, 779721474048, 2339164422144
(PARI) a(n)={my(v=vector(logint(max(1, n), 2)+1)); v[1]=2; for(n=2, #v, v[n]=v[n-1]^2 + 2^(2^(n-1)-1)); prod(k=1, #v, if(bittest(n, k-1), v[k], 1))} \\ Andrew Howroyd, Feb 27 2020
Terms a(17) and beyond from Andrew Howroyd, Feb 27 2020
proposed
editing
editing
proposed