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!)
A226024 Integers n such that (sum of digits of 10234*n) = n. 0
10, 13, 15, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 32, 34, 37, 38 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Inspired by Carmine Suriano's comment in A113315.
Proof that 38 is the highest value: 10234*38=388892 has 6 digits. Maximum value of digitsum for a 6-digit numer is 54. Direct inspection of digitsum of 10234*39=399126 through 10234*54=552637 shows that no other solution exists. For numbers 55 through 97, direct inspection shows that no other solution exists either. For n>97, the number has 7 digits, having 63 as its maximum digitsum; therefore, no solution exists for any number >97. - Carmine Suriano, Sep 23 2013
LINKS
EXAMPLE
A007953(10234*n) = n.
CROSSREFS
Sequence in context: A256477 A247464 A219110 * A134651 A135548 A102502
KEYWORD
base,nonn,fini,full
AUTHOR
Zak Seidov, May 23 2013
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 16 14:17 EDT 2024. Contains 371740 sequences. (Running on oeis4.)