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.

A078243 Smallest multiple of n using only digits 0 and 4.

Original entry on oeis.org

4, 4, 444, 4, 40, 444, 4004, 40, 444444444, 40, 44, 444, 4004, 4004, 4440, 400, 44404, 444444444, 44004, 40, 40404, 44, 440404, 4440, 400, 4004, 4404444444, 4004, 4404404, 4440, 444044, 4000, 444444, 44404, 40040, 444444444, 444, 44004, 40404
Offset: 1

Views

Author

Amarnath Murthy, Nov 23 2002

Keywords

Comments

a(n) = min{A169967(k): k > 1 and A169967(k) mod n = 0}. [Reinhard Zumkeller, Jan 10 2012]

Crossrefs

Programs

  • Haskell
    a078243 n = head [x | x <- tail a169967_list, mod x n == 0]
    -- Reinhard Zumkeller, Jan 10 2012

Extensions

More terms from Ray Chandler, Jul 12 2004