login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195191 Smallest n-Smith number. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

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

LINKS

Table of n, a(n) for n=2..29.

Shyam Sunder Gupta, Smith numbers

EXAMPLE

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

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

CROSSREFS

Sequence in context: A247995 A247996 A068548 * A275232 A061594 A145403

Adjacent sequences:  A195188 A195189 A195190 * A195192 A195193 A195194

KEYWORD

nonn,base

AUTHOR

Kausthub Gudipati, Sep 11 2011

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 23:17 EDT 2022. Contains 355086 sequences. (Running on oeis4.)