|
|
|
|
1, 2, 3, 2, 1, 4, 5, 2, 1, 2, 3, 4, 1, 6, 7, 2, 1, 2, 3, 2, 1, 4, 5, 4, 1, 2, 3, 6, 1, 8, 9, 2, 1, 2, 3, 2, 1, 4, 5, 2, 1, 2, 3, 4, 1, 6, 7, 4, 1, 2, 3, 2, 1, 4, 5, 6, 1, 2, 3, 8, 1, 10, 11, 2, 1, 2, 3, 2, 1, 4, 5, 2, 1, 2, 3, 4, 1, 6, 7, 2, 1, 2, 3, 2, 1, 4, 5, 4, 1, 2, 3, 6, 1, 8, 9, 4, 1, 2, 3, 2, 1, 4, 5, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Restricted growth sequence transform of the ordered pair [A000035(n), A007814(1+A000265(n))], parity and the number of trailing 1-bits in the odd part of n (i.e., the length of the rightmost run of 1-bits in its binary expansion).
|
|
LINKS
|
|
|
PROG
|
(PARI)
up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om, invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om, invec[i], i); outvec[i] = u; u++ )); outvec; };
v336126 = rgs_transform(vector(up_to, n, Aux336126(n)));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|