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!)
A053380 a(n) contains n digits (either '8' or '9') and is divisible by 2^n. 2
8, 88, 888, 9888, 89888, 989888, 9989888, 89989888, 989989888, 8989989888, 98989989888, 898989989888, 8898989989888, 98898989989888, 998898989989888, 8998898989989888, 98998898989989888, 898998898989989888 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n)=a(n-1)+10^(n-1)*(8+[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 9.
CROSSREFS
Sequence in context: A053379 A002282 A112907 * A250166 A247738 A115864
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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)