This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053338 a(n) contains n digits (either '6' or '9') and is divisible by 2^n. 1
 6, 96, 696, 9696, 69696, 669696, 6669696, 96669696, 696669696, 9696669696, 69696669696, 969696669696, 9969696669696, 69969696669696, 969969696669696, 9969969696669696, 99969969696669696, 999969969696669696 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n)=a(n-1)+10^(n-1)*(6+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 a 6, if not then n-th term begins with a 9. CROSSREFS Cf. A023410, A050621, A050622, A035014. Sequence in context: A179058 A303212 A226549 * A115400 A279868 A055358 Adjacent sequences:  A053335 A053336 A053337 * A053339 A053340 A053341 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 October 13 20:38 EDT 2019. Contains 327981 sequences. (Running on oeis4.)