login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A277757
a(n) = 2^(6n+1).
1
2, 128, 8192, 524288, 33554432, 2147483648, 137438953472, 8796093022208, 562949953421312, 36028797018963968, 2305843009213693952, 147573952589676412928, 9444732965739290427392, 604462909807314587353088, 38685626227668133590597632
OFFSET
0,1
COMMENTS
Additive digital root of a(n) = 2.
FORMULA
a(n) = 64*a(n-1).
G.f.: 2/(1-64*x). a(n) = 2*A089357(n). - R. J. Mathar, Dec 02 2016
CROSSREFS
Sequence in context: A106318 A202748 A322308 * A010367 A024344 A012673
KEYWORD
nonn,easy
AUTHOR
Miquel Cerda, Oct 28 2016
STATUS
approved