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!)
 A053377 a(n) contains n digits (either '3' or '8') and is divisible by 2^n. 0
 8, 88, 888, 3888, 33888, 333888, 3333888, 83333888, 383333888, 3383333888, 33383333888, 833383333888, 8833383333888, 88833383333888, 888833383333888, 8888833383333888, 88888833383333888, 888888833383333888 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n)=a(n-1)+10^(n-1)*(8-5*[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 3. MATHEMATICA Flatten[Table[Select[FromDigits/@Tuples[{3, 8}, n], Divisible[#, 2^n]&], {n, 18}]] (* Harvey P. Dale, Dec 25 2015 *) CROSSREFS Cf. A023412, A050621, A050622, A035014. Sequence in context: A043043 A003492 A053376 * A053378 A062185 A053379 Adjacent sequences:  A053374 A053375 A053376 * A053378 A053379 A053380 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 25 17:53 EDT 2020. Contains 334595 sequences. (Running on oeis4.)