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 A082967 #22 Jan 23 2019 09:59:30 %S A082967 213,1937,3093,3097,4529,6401,7165,9753,9933,10117,10541,10577,11301, %T A082967 13385,15005,18641,18829,18965,25089,34413,36285,37833,37909,38157, %U A082967 38405,38409,38413,39529,40461,42981,44457,46577,48741,51365,55477 %N A082967 Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6. %C A082967 The terms up to 18965 were first given by _Ignacio Larrosa Cañestro_ in a thread entitled "Seven consecutive numbers" in the newsgroup sci.math on Apr 29 2003. - _Hugo Pfoertner_, Aug 26 2006 %H A082967 Harvey P. Dale, <a href="/A082967/b082967.txt">Table of n, a(n) for n = 1..1000</a> %H A082967 Ignacio Larrosa Cañestro, <a href="http://groups.google.com/group/sci.math/msg/02d75ce5b91ccb8e">Seven consecutive numbers</a>. Posting in newsgroup sci.math, Apr 29 2003. %t A082967 Position[Partition[MoebiusMu[Range[60000]],7,1],_?(Total[#] == 6&),1,Heads->False]//Flatten (* _Harvey P. Dale_, Jan 23 2019 *) %o A082967 (PARI) isok(n) = moebius(n) + moebius(n+1) + moebius(n+2) + moebius(n+3) + moebius(n+4) + moebius(n+5) + moebius(n+6) == 6 \\ _Michel Marcus_, Aug 06 2013 %Y A082967 Cf. A070268, A063838, A008683. %K A082967 nonn %O A082967 1,1 %A A082967 Yuval Dekel (dekelyuval(AT)hotmail.com), May 27 2003 %E A082967 More terms from _Rick L. Shepherd_, May 28 2003