cp's OEIS Frontend

A298161 Nonnegative numbers n such that for any k > 0, n + k is not a multiple of prime(k) (where prime(k) denotes the k-th prime).

%I A298161 #18 Jan 16 2019 02:44:11
%S A298161 0,8,18,26,36,54,56,74,84,86,134,140,156,168,170,174,194,200,216,224,
%T A298161 236,240,246,260,300,308,324,326,366,368,386,390,414,420,440,456,464,
%U A298161 476,494,498,518,536,560,564,576,590,594,624,630,650,660,678,698,708
%N A298161 Nonnegative numbers n such that for any k > 0, n + k is not a multiple of prime(k) (where prime(k) denotes the k-th prime).
%C A298161 Equivalently, these are the numbers n >= 0 such that A298155(n) = 1.
%C A298161 Equivalently, these are the numbers n >= 0 such that the diagonal of A060175 starting at A060175(n+1, 1) contains only zeros.
%C A298161 All terms are even.
%C A298161 This sequence is a subsequence of A005843, A007494, A047207 and A047318.
%H A298161 Robert Israel, <a href="/A298161/b298161.txt">Table of n, a(n) for n = 1..10000</a>
%F A298161 A007814(a(n) + 1) = 0.
%F A298161 A007949(a(n) + 2) = 0.
%F A298161 A112765(a(n) + 3) = 0.
%F A298161 A214411(a(n) + 4) = 0.
%p A298161 filter:= proc(n) local p, k;
%p A298161   p:= 1:
%p A298161   for k from 1 do
%p A298161     p:= nextprime(p);
%p A298161     if p > n+k then return true
%p A298161     elif n+k mod p = 0 then return false
%p A298161     fi
%p A298161   od
%p A298161 end proc:
%p A298161 select(filter, [seq(i,i=0..1000,2)]); # _Robert Israel_, Jan 16 2018
%Y A298161 Cf. A005843, A007494, A007814, A007949, A047207, A047318, A060175, A112765, A214411, A298155.
%K A298161 nonn
%O A298161 1,2
%A A298161 _Rémy Sigrist_, Jan 14 2018