login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277757 a(n) = 2^(6n+1). 0
2, 128, 8192, 524288, 33554432, 2147483648, 137438953472, 8796093022208, 562949953421312, 36028797018963968, 2305843009213693952, 147573952589676412928, 9444732965739290427392, 604462909807314587353088, 38685626227668133590597632 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Additive digital root of a(n) = 2.

LINKS

Table of n, a(n) for n=0..14.

Tanya Khovanova, Recursive Sequences.

Index to divisibility sequences.

Index entries for linear recurrences with constant coefficients, signature (64).

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

Adjacent sequences:  A277754 A277755 A277756 * A277758 A277759 A277760

KEYWORD

nonn,easy

AUTHOR

Miquel Cerda, Oct 28 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 10:33 EDT 2020. Contains 333239 sequences. (Running on oeis4.)