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.

A078248 Smallest multiple of n using only digits 0 and 9.

Original entry on oeis.org

9, 90, 9, 900, 90, 90, 9009, 9000, 9, 90, 99, 900, 9009, 90090, 90, 90000, 99909, 90, 99009, 900, 9009, 990, 990909, 9000, 900, 90090, 999, 900900, 9909909, 90, 999099, 900000, 99, 999090, 90090, 900, 999, 990090, 9009, 9000, 99999, 90090, 9909909
Offset: 1

Views

Author

Amarnath Murthy, Nov 23 2002

Keywords

Comments

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

Crossrefs

Programs

  • Haskell
    a078248 n = head [x | x <- tail a097256_list, mod x n == 0]
    -- Reinhard Zumkeller, Jan 10 2012
  • Mathematica
    With[{t=Flatten[Table[FromDigits[Join[{9},#]]&/@Tuples[{0,9},n],{n,0,6}]]},Flatten[Table[Select[t,Divisible[#,i]&,1],{i,50}]]] (* Harvey P. Dale, May 31 2014 *)

Extensions

More terms from Ray Chandler, Jul 12 2004