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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053378 a(n) contains n digits (either '5' or '8') and is divisible by 2^n. 0
 8, 88, 888, 5888, 85888, 885888, 8885888, 58885888, 558885888, 8558885888, 58558885888, 858558885888, 5858558885888, 85858558885888, 585858558885888, 5585858558885888, 55585858558885888, 855585858558885888 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n)=a(n-1)+10^(n-1)*(8-3*[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with an 8, if not then n-th term begins with a 5. CROSSREFS Cf. A023413, A050621, A050622, A035014. Sequence in context: A003492 A053376 A053377 * A062185 A053379 A002282 Adjacent sequences:  A053375 A053376 A053377 * A053379 A053380 A053381 KEYWORD base,nonn AUTHOR Henry Bottomley, Mar 06 2000 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.

Last modified May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)