login
A172357
n such that the Liouville function lambda(n) take successively, from n, the values 1,-1,1,-1,1,-1
1
58, 185, 194, 274, 287, 342, 344, 382, 493, 566, 667, 856, 858, 926, 1012, 1014, 1157, 1165, 1230, 1232, 1234, 1267, 1318, 1385, 1393, 1418, 1482, 1484, 1679, 1681, 1795, 1841, 1915, 1917, 2060, 2062, 2064, 2232, 2340, 2342, 2567, 2569, 2627, 2805, 3013
OFFSET
1,1
LINKS
MAPLE
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;
MATHEMATICA
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
PROG
(PARI) lambda(n)=(-1)^bigomega(n);
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 */
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Feb 01 2010
STATUS
approved