This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212284 First a(n) > 1 such that its sum of digits is the same in base 10 as in base n. 1
 20, 21, 12, 40, 50, 21, 70, 153, 10, 190, 108, 40, 126, 135, 50, 153, 162, 20, 180, 190, 70, 207, 216, 80, 234, 243, 30, 261, 270, 190, 290, 594, 102, 315, 324, 40, 342, 351, 120, 370, 380, 130, 792, 405, 50, 423, 432, 150, 450, 460, 160, 480, 490, 60, 504 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS There might exist an n for which there is no solution, in which case a(n) would be set to 0 by convention; however, no such case was found so far. Problem: does it exist? LINKS Stanislav Sykora, Table of n, a(n) for n = 2..10000 EXAMPLE a(12)=108 because 108 is the first number >1 such that when written in base 10 and in base 12 (i.e., 90), the sum of the expansion digits is the same, namely 9. CROSSREFS Cf. A037308. Sequence in context: A302363 A165841 A222958 * A091235 A078286 A004461 Adjacent sequences:  A212281 A212282 A212283 * A212285 A212286 A212287 KEYWORD nonn,easy,base AUTHOR Stanislav Sykora, May 08 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 07:12 EST 2018. Contains 318158 sequences. (Running on oeis4.)