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!)
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. 2

%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

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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)