Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Feb 18 2019 02:15:11
%S 29,41,101,137,229,281,429,433,617,641,645,741,821,969,1021,1085,1129,
%T 1221,1309,1433,1489,1581,1597,1605,1613,1697,1741,1877,1885,2013,
%U 2053,2081,2085,2109,2161,2237,2265,2309,2337,2377,2381,2397,2409,2633,2657
%N Numbers n such that mu(n) + mu(n+1) + mu(n+2) = -3.
%C All terms == 1 (mod 4). - _Robert Israel_, Feb 17 2019
%H Robert Israel, <a href="/A070268/b070268.txt">Table of n, a(n) for n = 1..10000</a>
%p with(numtheory): A070268:=n->`if`(mobius(n)+mobius(n+1)+mobius(n+2)=-3, n, NULL): seq(A070268(n), n=1..10^4); # _Wesley Ivan Hurt_, Feb 05 2017
%o (PARI) for(n=1,1000,if(moebius(n)+moebius(n+1)+moebius(n+2)==-3,print1(n,",")))
%Y Cf. A063838.
%K nonn
%O 1,1
%A Sharon Sela (sharonsela(AT)hotmail.com), May 09 2002
%E More terms from _Benoit Cloitre_, May 13 2002