cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A254003 For n>=1, let B_n(k) be the sequence defined by b(1)=1, b(2)=p_1, ..., b(n+2)=p_(n+1), thereafter (for k>=n+3) the smallest number not occurring earlier having at least one common factor with b(k-(n+1)), but none with b(k-1)*b(k-2)*...*b(k-n); a(n) is m such that B_n(m)=6.

This page as a plain text file.
%I A254003 #9 Apr 26 2015 14:58:07
%S A254003 10,14,83,157,1190,206
%N A254003 For n>=1, let B_n(k) be the sequence defined by b(1)=1, b(2)=p_1, ..., b(n+2)=p_(n+1), thereafter (for k>=n+3) the smallest number not occurring earlier having at least one common factor with b(k-(n+1)), but none with b(k-1)*b(k-2)*...*b(k-n); a(n) is m such that B_n(m)=6.
%C A254003 In particular, A098550(10)=6, A247225(14)=6.
%C A254003 On the other hand, it seems likely that 6 never appears in A247665 (which has a different although related definition). - _N. J. A. Sloane_, Apr 26 2015
%Y A254003 Cf. A098550, A247225, A247665.
%K A254003 nonn,more
%O A254003 1,1
%A A254003 _Vladimir Shevelev_ and _Peter J. C. Moses_, Jan 22 2015