[go: up one dir, main page]
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!)
A066156 a(n) is the least k>n such that k*n = (product of digits of k) * (sum of digits of k), or 0 if no such k exists. 0
10, 135, 15, 139968, 18, 756, 476, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n) = 0 for all n > 8: see A049101. - Robert Israel, Aug 18 2020
LINKS
Table of n, a(n) for n=0..94.
MATHEMATICA
Do[ k = n + 1; While[ k*n != Apply[Times, IntegerDigits[k]] Apply[Plus, IntegerDigits[k]], k++ ]; Print[k], {n, 0, 10} ]
CROSSREFS
Cf. A007953 (sum of digits), A007954 (product of digits).
Cf. A049101.
Sequence in context: A203325 A324421 A284162 * A173044 A218440 A048666
Adjacent sequences: A066153 A066154 A066155 * A066157 A066158 A066159
KEYWORD
base,nonn
AUTHOR
Robert G. Wilson v, Dec 13 2001
EXTENSIONS
Edited by Robert Israel, Aug 18 2020
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 August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)