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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053335 a(n) contains n digits (either '3' or '6') and is divisible by 2^n. 1
6, 36, 336, 6336, 66336, 366336, 6366336, 36366336, 636366336, 3636366336, 33636366336, 333636366336, 3333636366336, 33333636366336, 633333636366336, 3633333636366336, 33633333636366336, 333633333636366336 (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 3.
CROSSREFS
Sequence in context: A129584 A052559 A367490 * A222925 A370752 A108733
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 16:55 EDT 2024. Contains 372297 sequences. (Running on oeis4.)