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.

A061410 Numbers k such that m*2^k+1 is not prime for all coefficients m in the range 0<=m<=k.

This page as a plain text file.
%I A061410 #15 Mar 25 2019 07:12:31
%S A061410 9,10,22,31,86,99,100,101,113,114,115,130,135,136,149,154,169,217,218,
%T A061410 223,224,283,301,309,358,383,384,422,423,424,425,426,449,457,473,495,
%U A061410 505,506,541,542,548,549,564,571,572,573,628,668,670,681,682,683,713
%N A061410 Numbers k such that m*2^k+1 is not prime for all coefficients m in the range 0<=m<=k.
%H A061410 Robert Israel, <a href="/A061410/b061410.txt">Table of n, a(n) for n = 1..285</a>
%p A061410 filter:= n -> andmap(not isprime, [seq(m*2^n+1,m=1..n)]):
%p A061410 select(filter, [$1..1000]); # _Robert Israel_, Dec 10 2017
%t A061410 okQ[n_] := AllTrue[2^n Range[n] + 1, CompositeQ];
%t A061410 Select[Range[1000], okQ] (* _Jean-François Alcover_, Mar 25 2019 *)
%o A061410 (PARI) isok(n) = {for (m=0, n, if (isprime(m*2^n+1), return (0));); return (1);} \\ _Michel Marcus_, Dec 11 2017
%Y A061410 Cf. A061411, A061412, A061413, A061414, A061415.
%K A061410 nonn
%O A061410 1,1
%A A061410 _Patrick De Geest_, May 15 2001