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!)
A053337 a(n) contains n digits (either '6' or '7') and is divisible by 2^n. 1
6, 76, 776, 7776, 67776, 667776, 6667776, 66667776, 766667776, 6766667776, 66766667776, 666766667776, 7666766667776, 77666766667776, 777666766667776, 7777666766667776, 77777666766667776, 777777666766667776 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n)=a(n-1)+10^(n-1)*(6+[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 7.
MATHEMATICA
Table[Select[FromDigits/@Tuples[{6, 7}, n], Divisible[#, 2^IntegerLength[ #]]&], {n, 18}]//Flatten (* Harvey P. Dale, Jul 10 2016 *)
CROSSREFS
Sequence in context: A181343 A241072 A137132 * A199026 A155643 A066797
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 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)