login
This site is supported by donations 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. 0
6, 76, 776, 7776, 67776, 667776, 6667776, 66667776, 766667776, 6766667776, 66766667776, 666766667776, 7666766667776, 77666766667776, 777666766667776, 7777666766667776, 77777666766667776, 777777666766667776 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

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.

CROSSREFS

Cf. A023409, A050621, A050622, A035014.

Sequence in context: A016090 A181343 A137132 * A199026 A155643 A066797

Adjacent sequences:  A053334 A053335 A053336 * A053338 A053339 A053340

KEYWORD

base,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 09:42 EST 2012. Contains 205756 sequences.