login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest concatenation of powers of 2 in ascending order that is a multiple of n, or 0 if no such number exists.
0

%I #2 Dec 05 2013 19:55:18

%S 1,12,12,12,0,12,1248163264128256,1248,12481632,0,1248163264128,12,

%T 1248,1248163264128256,0,1248,1248163264128256512,12481632,12481632,0,

%U 124816326412825651210242048,1248163264128,1248163264,1248,0,1248

%N Smallest concatenation of powers of 2 in ascending order that is a multiple of n, or 0 if no such number exists.

%C a(n) = 0 for n = 5k.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Apr 24 2002

%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 09 2002