%I A113271
%S A113271 1,3,9,41,543,135457,8606778433,36893769626691833985,
%T A113271 680564733921105089459460297630318346497,
%U A113271 231584178474632390853419071752762496470716041121409734167406717963826481922561
%N A113271 Ascending descending base exponent transform of 2^n.
%C A113271 A003101 is the ascending descending base exponent transform of natural 
               numbers A000027. The ascending descending base exponent transform 
               applied to the Fibonacci numbers is A113122; applied to the tribonacci 
               numbers is A113153; applied to the Lucas numbers is A113154. The 
               smallest primes in this (always odd) sequence are a(1) = 3, a(3) 
               = 41 and a(5) = 543. What is the next prime?
%F A113271 a(n) = SUM[from i = 0 to n] (2^i)^(2^(n-i+1)). a(n) = SUM[from i = 0 
               to n] (2^(n-i+1))^(2^i). a(n) = SUM[from i = 0 to n] (A000079(i))^(A000079(n-i+1)).
%e A113271 a(0) = 1 because (2^0)^(2^0) = 1^1 = 1.
%e A113271 a(1) = 3 = (2^0)^(2^1) + (2^1)^(2^0) = 1^2 + 2^1.
%e A113271 a(2) = 9 = (2^0)^(2^2) + (2^1)^(2^1) + (2^2)^(2^0) = 1^4 + 2^2 + 4^1.
%e A113271 a(3) = 41 = 1^8 + 2^4 + 4^2 + 8^1.
%e A113271 a(4) = 543 = 1^16 + 2^8 + 4^4 + 8^2 + 16^1
%e A113271 a(5) = 135457 = 1^32 + 2^16 + 4^8 + 8^4 + 16^2 + 32^1.
%e A113271 a(6) = 8606778433 = 1^64 + 2^32 + 4^16 + 8^8 + 16^4 + 32^2 + 64^1.
%e A113271 a(7) = 36893769626691833985 = 1^128 + 2^64 + 4^32 + 8^16 + 16^8 + 32^4 
               + 64^2 + 128^1.
%e A113271 a(8) = 680564733921105089459460297630318346497 = 1^256 + 2^128 + 4^64 
               + 8^32 + 16^16 + 32^8 + 64^4 + 128^2 + 256^1.
%Y A113271 Cf. A000079, A005408, A113122, A113153, A113154.
%Y A113271 Sequence in context: A074502 A109743 A139150 this_sequence A057724 A129879 
               A001427
%Y A113271 Adjacent sequences: A113268 A113269 A113270 this_sequence A113272 A113273 
               A113274
%K A113271 easy,nonn
%O A113271 0,2
%A A113271 Jonathan Vos Post (jvospost3(AT)gmail.com), Jan 07 2006