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!)
A327617 a(n) is the least integer k such that digit_sum(A007494(n)*k) = digit_sum(A007494(n)+k). 0
0, 2, 6, 8, 3, 5, 9, 2, 6, 8, 3, 32, 9, 2, 6, 35, 3, 5, 9, 20, 6, 17, 66, 14, 9, 11, 6, 8, 3, 14, 9, 2, 15, 17, 3, 5, 63, 11, 6, 8, 3, 23, 18, 11, 33, 8, 3, 5, 27, 2, 6, 8, 3, 50, 18, 2, 6, 35, 3, 5, 18, 2, 6, 44, 3, 41, 90, 2, 6, 35, 3, 32, 90, 2, 186, 62, 3, 32, 9, 20, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
It appears that most terms are less than 100.
LINKS
PROG
(PARI) lista(nn) = {for (n=0, nn, if ((n%3) != 1, my(k=0); while(sumdigits(n+k) != sumdigits(n*k), k++); print1(k, ", "); ); ); } \\ Michel Marcus, Sep 19 2019
CROSSREFS
Cf. A007494, A007953 (sum of digits).
Sequence in context: A067067 A119279 A344171 * A303495 A048741 A276709
KEYWORD
nonn,base
AUTHOR
Max Lacoma, Sep 19 2019
STATUS
approved

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)