%I A063481
%S A063481 2,12,80,576,4352,33792,266240,2113536,16842752,134479872,1074790400,
%T A063481 8594128896,68736253952,549822922752,4398314946560,35185445830656,
%U A063481 281479271677952,2251816993554432,18014467228958720,144115462953762816
%N A063481 4^n + 8^n.
%C A063481 Shift 2^n+1 left 2n bits.
%H A063481 Harry J. Smith, <a href="b063481.txt">Table of n, a(n) for n=0,...,200</
               a>
%H A063481 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%F A063481 G.f.: 1/(1-4*x)+1/(1-8*x). E.g.f.: e^(4*x)+e^(8*x). [From Mohammad K. 
               Azarian (azarian(AT)evansville.edu), Jan 11 2009]
%e A063481 n=3: 23+1 shifted 2*3 bits to the left is 576 because 23+1 in binary 
               is: [1, 0, 0, 1] and 576 is: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0].
%t A063481 Table[4^n + 8^n, {n, 0, 25}]
%o A063481 (PARI) for(n=0,22,print(shift(2^n+1,2*n)))
%o A063481 (PARI) { for (n=0, 200, write("b063481.txt", n, " ", shift(1, 2*n) + 
               shift(1, 3*n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               Aug 23 2009]
%Y A063481 Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, 
               A007689, A063376, A074600 - A074624.
%Y A063481 Sequence in context: A107632 A082142 A069723 this_sequence A052822 A058872 
               A055548
%Y A063481 Adjacent sequences: A063478 A063479 A063480 this_sequence A063482 A063483 
               A063484
%K A063481 easy,nonn
%O A063481 0,1
%A A063481 Jason Earls (zevi_35711(AT)yahoo.com), Jul 28 2001
%E A063481 Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 25 2002