A263110 n is the a(n)-th positive integer having its digitsum in base-16 representation.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 6, 6, 6, 6, 6, 6, 6
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
- Eric Weisstein's World of Mathematics, Hexadecimal
- Eric Weisstein's World of Mathematics, Digit Sum
- Wikipedia, Hexadecimal
- Wikipedia, Digit sum
Programs
-
Haskell
import Data.IntMap (empty, findWithDefault, insert) a263110 n = a263110_list !! (n-1) a263110_list = f 1 empty where f x m = y : f (x + 1) (insert q (y + 1) m) where y = findWithDefault 1 q m; q = a053836 x
Comments