cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050622 Numbers m that are divisible by 2^k, where k is the digit length of m.

Original entry on oeis.org

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

Views

Author

Patrick De Geest, Jun 15 1999

Keywords

Comments

The number of terms of length k is equal to (9*5^(k-1) - 1)/2. - Bernard Schott, Apr 06 2020

Crossrefs

Programs

  • 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 *)
  • PARI
    isok(n) = n % (2^#Str(n)) == 0; \\ Michel Marcus, Sep 17 2015