login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053314 a(n) contains n digits (either '1' or '4') and is divisible by 2^n. 0
4, 44, 144, 4144, 14144, 414144, 1414144, 41414144, 441414144, 1441414144, 11441414144, 411441414144, 4411441414144, 44411441414144, 444411441414144, 1444411441414144, 41444411441414144, 441444411441414144 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n)=a(n-1)+10^(n-1)*(4-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 2, if not then n-th term begins with a 7.

CROSSREFS

Cf. A023401, A050621, A050622, A035014.

Sequence in context: A071125 A193448 A200456 * A051223 A077435 A074751

Adjacent sequences:  A053311 A053312 A053313 * A053315 A053316 A053317

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 14 02:58 EST 2012. Contains 205567 sequences.