OFFSET
1,3
COMMENTS
Whenever a(n) is a multiple of 9, then a(n+1) = a(n) + 1 is also a base 9 perfect digital invariant, with the same exponent k. - M. F. Hasler, Nov 21 2019
LINKS
Joseph Myers, Table of n, a(n) for n=1..506 (complete to 120 base 9 digits)
PROG
(PARI) select( {is_A162234(n, b=9)=n<b|| forstep(p=logint(n, max(vecmax(b=digits(n, b)), 2)), 2, -1, my(t=vecsum([d^p|d<-b])); t>n|| return(t==n))}, [0..10^5]) \\ M. F. Hasler, Nov 21 2019
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Joseph Myers, Jun 28 2009
STATUS
approved