login
A269169
The least monotonic left inverse for A269164.
3
1, 2, 3, 4, 5, 6, 6, 7, 8, 9, 10, 11, 11, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 21, 21, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 41, 41, 41, 41, 41, 41, 42, 42, 43, 44, 45, 46, 47, 48, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66
OFFSET
1,2
COMMENTS
a(n) = number of terms of A269164 <= n.
LINKS
FORMULA
Other identities. For all n >= 1:
a(A269164(n)) = n.
MATHEMATICA
terms = 100; Clear[f]; f[max_] := f[max] = (s = Sort[Table[BitXor[n, BitOr[ 2 n, 4 n]], {n, 0, max}]]; Complement[Range[Last[s]], s][[1 ;; terms]]); f[terms]; f[max = 2 terms]; While[Print[max]; f[max] != f[max/2], max = 2 max]; A269164 = f[max]; a[n_] := Count[A269164, k_ /; k <= n]; Table[ a[n], {n, 1, Length[A269164]}] (* Jean-François Alcover, Feb 23 2016 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A269169 (LEFTINV-LEASTMONO 1 1 A269164))
CROSSREFS
Sequence in context: A082287 A331267 A238839 * A248148 A210062 A245337
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 21 2016
STATUS
approved