Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.
A094096
Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.
Terms
- a(0) =1a(1) =5a(2) =1a(3) =494a(4) =533a(5) =133a(6) =1a(7) =361131a(8) =998130a(9) =318354a(10) =389455a(11) =275577a(12) =42778a(13) =14162a(14) =1a(15) =4436526107a(16) =21759994113a(17) =223006618265a(18) =97254937860a(19) =19669357917
External references
- oeis: A094096