login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A053377
a(n) contains n digits (either '3' or '8') and is divisible by 2^n.
1
8, 88, 888, 3888, 33888, 333888, 3333888, 83333888, 383333888, 3383333888, 33383333888, 833383333888, 8833383333888, 88833383333888, 888833383333888, 8888833383333888, 88888833383333888, 888888833383333888
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
KEYWORD
base,nonn
AUTHOR
Henry Bottomley, Mar 06 2000
STATUS
approved