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.

A195191 Smallest n-Smith number.

Original entry on oeis.org

32, 402, 2401, 2030, 10112, 10, 200, 10200, 10010, 100200, 1000110, 1000200, 100, 20000, 10200000, 1001000, 100200000, 1000110000, 1000200000, 1000, 2000000, 10200000000, 100100000, 100200000000, 1000110000000, 1000000000100, 10000, 200000000
Offset: 2

Views

Author

Kausthub Gudipati, Sep 11 2011

Keywords

Comments

The smallest number for which the sum of the digits of its prime factors equals n multiplied by the sum of its digits.

Examples

			The first term of A104390, the first term of A104391, the first term of A103125 etc.
		

Programs

  • Maple
    A007953 := proc(n) add(d,d=convert(n,base,10)) ; end proc:
    A118503 := proc(n) a := 0 ; for p in ifactors(n)[2] do a := a+ op(2,p)*A007953(op(1,p)) ; end do: a ; end proc:
    A195191 := proc(n) for k from 1 do if A118503(k) = n*A007953(k) then return k; end if; end do: end proc: # R. J. Mathar, Sep 14 2011

Extensions

a(12)-a(29) from Donovan Johnson, Sep 15 2011