A263109 n is the a(n)-th positive integer having its digitsum in base-12 representation.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 7, 7, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 8, 8, 8
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
- Eric Weisstein's World of Mathematics, Duodecimal
- Eric Weisstein's World of Mathematics, Digit Sum
- Wikipedia, Duodecimal
- Wikipedia, Digit sum
Programs
-
Haskell
import Data.IntMap (empty, findWithDefault, insert) a263109 n = a263109_list !! (n-1) a263109_list = f 1 empty where f x m = y : f (x + 1) (insert q (y + 1) m) where y = findWithDefault 1 q m; q = a053832 x
-
Mathematica
b[_] = 1; a[n_] := a[n] = With[{t = Total[IntegerDigits[n, 12]]}, b[t]++]; Array[a, 100] (* Jean-François Alcover, Dec 18 2021 *)
Comments