cp's OEIS Frontend

A075154 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.

%I A075154 #18 Feb 09 2025 18:38:29
%S A075154 1,2,3,4,5,6,7,8,9,910,0,912,11713,6314,915,3616,15317,918,17119,9920,
%T A075154 18921,9922,82823,19824,9925,46826,18927,18928,78329,99930,585931,
%U A075154 388832,1098933,198934,289835,99936,99937,478838,198939,1999840
%N A075154 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 A075154 The modulo requirements means values up to n=99 can be computed. - _R. J. Mathar_, Feb 08 2023
%D A075154 Sandro Boscaro, Nivenmorphic Integers, Journal of Recreational Mathematics, Vol. 28 (1996-97), Number 3, pp. 201-205.
%H A075154 Sean A. Irvine, <a href="/A075154/b075154.txt">Table of n, a(n) for n = 1..99</a>
%H A075154 <a href="/index/Ar#automorphic">Index entries for sequences related to automorphic numbers</a>
%e A075154 a(10)=910 since 10 divides 910, 9 + 1 + 0 = 10 and 910 ends with 10.
%Y A075154 Cf. A005349, A187924.
%K A075154 nonn,base,fini,full
%O A075154 1,2
%A A075154 Sandro Boscaro (sboscaro(AT)libero.it), Sep 06 2002
%E A075154 Edited by _Matthew Conroy_, Oct 21 2002