A277757 a(n) = 2^(6*n + 1).

2, 128, 8192, 524288, 33554432, 2147483648, 137438953472, 8796093022208, 562949953421312, 36028797018963968, 2305843009213693952, 147573952589676412928, 9444732965739290427392, 604462909807314587353088, 38685626227668133590597632

Offset: 0

Author

Miquel Cerda, Oct 28 2016

Keywords

• nonn
• easy

Comments

Additive digital root of a(n) = 2.

Links

• Tanya Khovanova, Recursive Sequences.
• Index to divisibility sequences.
• Index entries for linear recurrences with constant coefficients, signature (64).

Crossrefs

Cf. A000079, A016921, A089357.

Formula

a(n) = 64*a(n-1).

From R. J. Mathar, Dec 02 2016: (Start)

G.f.: 2/(1-64*x).

a(n) = 2*A089357(n). (End)

From Elmo R. Oliveira, Feb 20 2025: (Start)

E.g.f.: 2*exp(64*x).

a(n) = A000079(A016921(n)). (End)