|
%I #6 Mar 11 2014 01:32:52
%S 1,2,5,11,3,7,23,47,191,31,127,383,3067,1019,509,61,29,13,53,107,43,
%T 173,347,859,3767,941,3931,491,983,7127,757,9973,311,19,79,317,829,
%U 103,359,179,89,601,37,101,229,919
%N 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(n-1); or, if no such prime exists, a(n) = the smallest prime not yet occurring that when written in binary, a(n-1) is contained as a substring within it.
%C Terms calculated by Hans Havermann.
%Y Cf. A175310
%K base,nonn
%O 0,2
%A _Leroy Quet_, Mar 27 2010
|
