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”).

A050622
Numbers m that are divisible by 2^k, where k is the digit length of m.
24
2, 4, 6, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336, 344, 352, 360
OFFSET
1,1
COMMENTS
The number of terms of length k is equal to (9*5^(k-1) - 1)/2. - Bernard Schott, Apr 06 2020
LINKS
MAPLE
seq(seq(j*2^k, j=(5^(k-1)+1)/2 .. 5^k-1), k=1..3); # Robert Israel, Apr 05 2020
MATHEMATICA
Select[Range[360], IntegerQ[#/2^IntegerLength[#]] &] (* Jayanta Basu, May 25 2013 *)
PROG
(PARI) isok(n) = n % (2^#Str(n)) == 0; \\ Michel Marcus, Sep 17 2015
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Patrick De Geest, Jun 15 1999
STATUS
approved