cp's OEIS Frontend

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.

A233445 Start of record runs with lambda(k) = lambda(k+1) = ..., where lambda is Liouville's function A008836.

This page as a plain text file.
%I A233445 #24 Oct 17 2016 11:41:45
%S A233445 1,2,11,17,27,140,213,1934,13871,38405,171707,200938,389409,1633357,
%T A233445 5460156,8405437,41983357,68780189,179376463,130292951546,
%U A233445 393142151459,2100234982892,5942636062287
%N A233445 Start of record runs with lambda(k) = lambda(k+1) = ..., where lambda is Liouville's function A008836.
%e A233445 Lambda(1) = 1 is the first (record) run, so a(1) = 1.
%e A233445 Lambda(2) = lambda(3) = -1 is the second record run, so a(2) = 2.
%e A233445 Lambda(11) = lambda(12) = lambda(13) = -1 is the third record run, so a(3) = 11.
%t A233445 sz[n_] := Module[{t = LiouvilleLambda[n], k = n}, While[LiouvilleLambda[k++] == t]; k - n]; r = 0; Reap[For[n = 1, n <= 10^6, n++, t = sz[n]; If[t > r, r = t; Print[t, " ", n]; Sow[n]]]][[2, 1]] (* _Jean-François Alcover_, Oct 17 2016, adapted from PARI *)
%o A233445 (PARI) L(n)=(-1)^bigomega(n);
%o A233445 sz(n)=my(t=L(n),k=n);while(L(k++)==t,);k-n
%o A233445 r=0;for(n=1,1e9,t=sz(n);if(t>r,r=t;print(t" "n)))
%Y A233445 Cf. A066793, A066794, A175201, A233459, A008836.
%K A233445 nonn
%O A233445 1,2
%A A233445 _Charles R Greathouse IV_, Dec 10 2013