A061762 a(n) = (sum of digits of n) + (product of digits of n).

[zak seidov]

OK, 
I've found (up to my stupidity):
a(n) = {118, 119, 133, 170, 171}
for n = {1111277, 11111277, 1111278, 1111556,
11111556}...
... rather dull, eh?
Zak


--- zak seidov <zakseidov at yahoo.com> wrote:

> Dear seqfans,
> from the first 1,000,001 terms,
> least absent, in A061762, values are:
> 
>
118,119,133,170,171,172,173,174,190,191,202,203,204,222,223,224,225,226,240,248,249,250,251,252,253,254,255,280,281,282,283,284,285,294,295,296,297,321,322,323,324,325,326,327,328,329,330,331,332,350,351,352,353,361,362,363,368,372,373,374,375,376,386,387,388,389,390,391,392,410,411,424,432,433,434,435,436,437,438,443,444,445,446,447,448,459,460,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,...
> 
> while the maximal value is (evidently):
> a(999999)=54+531441=531495
> 
> Can anyone (and wish to) find smallest n's for 
> a(n)=0...1000 (e.g.)?
> Then we can submit sequence and b.file,
> Thanks, Zak
> 
> BTW I could not understand relevance of link to
> Matthew M. Conroy site.
> 
> 
>        
>
____________________________________________________________________________________
> Take the Internet to Go: Yahoo!Go puts the Internet
> in your pocket: mail, news, photos & more. 
> http://mobile.yahoo.com/go?refer=1GNXIC
> 



       
____________________________________________________________________________________
Pinpoint customers who are looking for what you sell. 
http://searchmarketing.yahoo.com/