

A175311


Let a(0) = 1. Either, a(n) = the largest prime not yet occurring in the sequence that, when written in binary, it is a substring in the binary representation of a(n1); or, if no such prime exists, a(n) = the smallest prime not yet occurring that when written in binary, a(n1) is contained as a substring within it.


1



1, 2, 5, 11, 3, 7, 23, 47, 191, 31, 127, 383, 3067, 1019, 509, 61, 29, 13, 53, 107, 43, 173, 347, 859, 3767, 941, 3931, 491, 983, 7127, 757, 9973, 311, 19, 79, 317, 829, 103, 359, 179, 89, 601, 37, 101, 229, 919
(list;
graph;
refs;
listen;
history;
text;
internal format)




