OFFSET
1,3
COMMENTS
A299690 can be used to find terms for this sequence below some bound by prepending ones to terms while staying below that bound so the additive and multiplicative root that term matches.
For example, 27 is in A299690 and has multiplicative root 4. 27 has the additive root 9. Prepending 4 ones gives the number 111127 which has multiplicative root 4, the same as 27 has, but it also has an additive root of 4. Furthermore, the digits are in nondecreasing order hence is in this sequence.
PROG
(PARI) is(n) = my(cn=n); d=digits(n); if(d!=vecsort(d), return(0)); while(cn>9, d=digits(cn); cn=prod(i=1, #d, d[i])); cn-1 == (n-1)%9 || n == 0
CROSSREFS
KEYWORD
nonn,base
AUTHOR
David A. Corneth, Aug 23 2018
STATUS
approved