Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Feb 08 2023 13:17:04
%S 1,2,3,4,5,6,7,8,9,910,0,912,11713,6314,915,3616,15317,918,17119,9920,
%T 18921,9922,82823,19824,9925,46826,18927,18928,78329,99930,585931,
%U 388832,1098933,198934,289835,99936,99937,478838,198939,1999840
%N a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.
%C The modulo requirements means values up to n=99 can be computed. - _R. J. Mathar_, Feb 08 2023
%D Sandro Boscaro, Nivenmorphic Integers, Journal of Recreational Mathematics, Vol. 28 (1996-97), Number 3, pp. 201-205.
%H <a href="/index/Ar#automorphic">Index entries for sequences related to automorphic numbers</a>
%e a(10)=910 since 10 divides 910, 9 + 1 + 0 = 10 and 910 ends with 10.
%Y Cf. A005349, A187924.
%K nonn,base,fini
%O 1,2
%A Sandro Boscaro (sboscaro(AT)libero.it), Sep 06 2002
%E Edited by _Matthew Conroy_, Oct 21 2002