The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172357 n such that the Liouville function lambda(n) take successively, from n, the values 1,-1,1,-1,1,-1 1

%I

%S 58,185,194,274,287,342,344,382,493,566,667,856,858,926,1012,1014,

%T 1157,1165,1230,1232,1234,1267,1318,1385,1393,1418,1482,1484,1679,

%U 1681,1795,1841,1915,1917,2060,2062,2064,2232,2340,2342,2567,2569,2627,2805,3013

%N n such that the Liouville function lambda(n) take successively, from n, the values 1,-1,1,-1,1,-1

%H Harvey P. Dale, <a href="/A172357/b172357.txt">Table of n, a(n) for n = 1..1000</a>

%p with(numtheory): for n from 1 to 4300 do;if (-1)^bigomega(n)=1 and (-1)^bigomega(n+1) = -1 and (-1)^bigomega(n+2) = 1 and (-1)^bigomega(n+3) = -1 and (-1)^bigomega(n+4) = 1 and (-1)^bigomega(n+5) = -1 then print(n); else fi ; od;

%t Transpose[Transpose[#][[1]]&/@Select[Partition[Table[{n, LiouvilleLambda[ n]},{n,3100}],6,1],Transpose[#][[2]]=={1,-1,1,-1,1,-1}&]][[1]] _Harvey P. Dale_, May 19 2012

%o (PARI) lambda(n)=(-1)^bigomega(n);

%o for(n=1,1e4,if(lambda(n)==1&lambda(n+1)==-1&lambda(n+2)==1&&lambda(n+3)==-1&lambda(n+4)==1&&lambda(n+5)==-1,print1(n", "))) /* _Charles R Greathouse IV_, Jun 13 2011 */

%Y Cf. A051470, A028488, A002819.

%K nonn

%O 1,1

%A _Michel Lagneau_, Feb 01 2010

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

Last modified June 16 04:07 EDT 2021. Contains 345055 sequences. (Running on oeis4.)