login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277426 a(n) = 2^(6n+5). 0
32, 2048, 131072, 8388608, 536870912, 34359738368, 2199023255552, 140737488355328, 9007199254740992, 576460752303423488, 36893488147419103232, 2361183241434822606848, 151115727451828646838272, 9671406556917033397649408, 618970019642690137449562112, 39614081257132168796771975168
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Additive digital root of a(n) = 5.
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
a(n) = 64*a(n-1).
G.f.: 32/(1-64*x). - Vincenzo Librandi, Oct 30 2016
MATHEMATICA
CoefficientList[Series[32 / (1 - 64 x), {x, 0, 20}], x] (* Vincenzo Librandi, Oct 30 2016 *)
CROSSREFS
Sequence in context: A303425 A317515 A300180 * A159364 A202734 A268054
KEYWORD
nonn
AUTHOR
Miquel Cerda, Oct 28 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 19:23 EDT 2024. Contains 376014 sequences. (Running on oeis4.)