The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277757 a(n) = 2^(6n+1). 1
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
Tanya Khovanova, Recursive Sequences.
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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 17:05 EDT 2024. Contains 373203 sequences. (Running on oeis4.)