|
%I #16 Dec 02 2016 15:40:34
%S 2,128,8192,524288,33554432,2147483648,137438953472,8796093022208,
%T 562949953421312,36028797018963968,2305843009213693952,
%U 147573952589676412928,9444732965739290427392,604462909807314587353088,38685626227668133590597632
%N a(n) = 2^(6n+1).
%C Additive digital root of a(n) = 2.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H <a href="http://oeis.org/index/Di#divseq">Index to divisibility sequences</a>.
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (64).
%F a(n) = 64*a(n-1).
%F G.f.: 2/(1-64*x). a(n) = 2*A089357(n). - _R. J. Mathar_, Dec 02 2016
%K nonn,easy
%O 0,1
%A _Miquel Cerda_, Oct 28 2016
| 