The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063849 Numbers k such that mu(k) + mu(k+1) + mu(k+2) = 1. 1

%I #15 Jun 25 2018 03:42:33

%S 8,13,21,24,25,26,37,44,49,50,54,57,62,63,74,75,80,90,115,116,119,120,

%T 123,134,146,157,160,175,177,185,187,206,207,209,224,234,248,253,259,

%U 260,265,274,278,287,294,295,296,304,314,321,323,324,329,332,338,340

%N Numbers k such that mu(k) + mu(k+1) + mu(k+2) = 1.

%H Harry J. Smith, <a href="/A063849/b063849.txt">Table of n, a(n) for n = 1..1000</a>

%o (PARI) m(n)=moebius(n)+moebius(n+1)+moebius(n+2);

%o j=[]; for(n=1,1000, if(m(n)==1,j=concat(j,n))); j

%o (PARI) M(n) = moebius(n) + moebius(n + 1) + moebius(n + 2)

%o { n=0; for (m=1, 10^9, if(M(m)==1, write("b063849.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 01 2009

%Y Cf. A063838.

%K easy,nonn

%O 1,1

%A _Jason Earls_, Aug 26 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 00:51 EDT 2024. Contains 373432 sequences. (Running on oeis4.)