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.
%I A063838 #20 May 08 2024 03:44:24
%S A063838 33,85,93,141,201,213,217,301,393,445,633,697,869,921,1041,1137,1189,
%T A063838 1253,1261,1345,1401,1589,1641,1761,1793,1837,1893,1937,1941,1981,
%U A063838 2045,2101,2181,2189,2217,2305,2361,2433,2461,2469,2489,2517,2561,2641,2721
%N A063838 Numbers k such that mu(k) + mu(k+1) + mu(k+2) = 3.
%D A063838 I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. 4th ed., Wiley, NY, 1980, p. 113.
%H A063838 Charles R Greathouse IV, <a href="/A063838/b063838.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%t A063838 Transpose[ Select[ Partition[ Range[ 3000 ], 3, 1 ], MoebiusMu[ #[ [ 1 ] ] ]+MoebiusMu[ #[ [ 2 ] ] ]+MoebiusMu[ #[ [ 3 ] ] ]==3& ] ][ [ 1 ] ]
%t A063838 Position[Partition[MoebiusMu[Range[3000]],3,1],_?(Total[#]==3&)]//Flatten (* _Harvey P. Dale_, May 08 2024 *)
%o A063838 (PARI) M(n) = moebius(n)+moebius(n+1)+moebius(n+2); j=[]; for(n=1,5000, if(M(n)==3,j=concat(j,n))); j
%o A063838 (PARI) M(n) = moebius(n) + moebius(n + 1) + moebius(n + 2)
%o A063838 n=0; for (m=1, 10^9, if(M(m)==3, write("b063838.txt", n++, " ", m); if (n==1000, break))) \\ _Harry J. Smith_, Sep 01 2009
%o A063838 (PARI) list(lim)=my(v=List(),run,last); forsquarefree(k=33,lim\1+2, if(moebius(k)==1, if(k[1]-last==1, if(run++>2, listput(v, k[1]-2)), run=1); last=k[1], last=run=0)); Vec(v) \\ _Charles R Greathouse IV_, Jan 08 2018
%Y A063838 Cf. A008683. A proper subset of A007675.
%K A063838 easy,nonn
%O A063838 1,1
%A A063838 _Jason Earls_, Aug 21 2001