OFFSET
1,2
COMMENTS
This sequence can be represented as a binary tree. Each left hand child is produced as A205783(1+n), and each right hand child as A206074(n), when the parent contains n:
|
...................1...................
4 2
9......../ \........7 6......../ \........3
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
16 23 14 17 12 13 8 5
27 47 36 71 24 41 28 53 21 31 22 37 15 19 10 11
etc.
LINKS
FORMULA
PROG
(PARI)
uplim = (2^21) + (2^20);
v206074 = vector(uplim);
v205783 = vector(uplim); v205783[1] = 1;
isA206074(n) = polisirreducible(Pol(binary(n)));
i=0; j=1; n=2; while((n < uplim), if(!(n%65536), print1(n, ", ")); if(isA206074(n), i++; v206074[i] = n, j++; v205783[j] = n); n++); print(n);
for(n=1, 8192, write("b260422.txt", n, " ", A260422(n)));
CROSSREFS
Inverse: A260421.
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Jul 25 2015
STATUS
approved