Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Number of integers in n-th run of squarefree positive integers.
42

%I #31 Apr 13 2019 07:08:56

%S 3,3,2,3,1,1,3,1,3,3,3,3,2,1,1,1,3,2,3,3,2,3,2,3,1,1,3,1,3,3,3,3,2,2,

%T 1,3,2,3,3,2,1,1,2,3,1,1,3,1,2,3,3,3,2,3,1,1,3,2,3,3,3,3,2,3,1,1,3,1,

%U 2,1,1,3,3,2,3,1,1,2,2,3,3,2,1,1,2,3,1

%N Number of integers in n-th run of squarefree positive integers.

%C The values 1, 2 and 3 occur 309008, 251134 and 439858 times, respectively, in the first 1000000 terms. - _Rick L. Shepherd_, Jul 25 2006

%C From _Reinhard Zumkeller_, Jan 20 2008: (Start)

%C 1 <= a(n) <= 3.

%C A136742(n) = Product{k=0..a(n)} (A072284(n)+k).

%C A136743(n) = Sum_{k=0..a(n)} A001221(A072284(n)+k).

%C (End)

%C Also the lengths of runs in A243348, differences of the n-th squarefree number and n. - _Antti Karttunen_, Jun 06 2014

%H A. Karttunen & R. Zumkeller (the first 1000 terms), <a href="/A120992/b120992.txt">Table of n, a(n) for n = 1..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Squarefree.html">Squarefree</a>

%e The runs of squarefree integers are as follows: (1,2,3), (5,6,7), (10,11), (13,14,15), (17), (19), (21,22,23),...

%p with(numtheory): a:=proc(n) if mobius(n)=0 then n else fi end: A:=[0,seq(a(n),n=1..500)]: b:=proc(n) if A[n]-A[n-1]>1 then A[n]-A[n-1]-1 else fi end: seq(b(n),n=2..nops(A)); # _Emeric Deutsch_, Jul 24 2006

%t t = {}; cnt = 0; Do[If[SquareFreeQ[n], cnt++, If[cnt > 0, AppendTo[t, cnt]; cnt = 0]], {n, 500}]; t (* _T. D. Noe_, Mar 19 2013 *)

%o (PARI) n=1; while(n<1000, c=0; while(issquarefree(n), n++; c++); print1(c,", "); while(!issquarefree(n), n++)) \\ _Rick L. Shepherd_, Jul 25 2006

%o (Scheme, with _Antti Karttunen_'s IntSeq-library)

%o (define (A120992 n) (if (= n 1) (Aincr_points_of_A243348 n) (- (Aincr_points_of_A243348 n) (Aincr_points_of_A243348 (- n 1)))))

%o ;; Using these two auxiliary functions, not submitted separately:

%o (define Aincr_points_of_A243348 (COMPOSE -1+ (NONZERO-POS 1 1 Afirst_diffs_of_A243348)))

%o (define (Afirst_diffs_of_A243348 n) (if (< n 2) (- n 1) (- (A243348 n) (A243348 (- n 1)))))

%Y Cf. A005117, A076259, A013928, A013929, A053797, A053806, A120993, A243348.

%K nonn

%O 1,1

%A _Leroy Quet_, Jul 21 2006

%E More terms from _Emeric Deutsch_ and _Rick L. Shepherd_, Jul 25 2006