# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a349236
Showing 1-1 of 1

%I A349236 #10 Nov 12 2021 04:36:00
%S A349236 1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,2,1,1,1,2,1,1,1,1,1,1,2,
%T A349236 1,1,1,1,1,1,2,1,1,1,1,2,2,1,1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1,3,
%U A349236 1,1,1,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,1
%N A349236 Gaps between cubefree numbers: a(n) = A004709(n+1) - A004709(n).
%C A349236 This sequence is unbounded since by the Chinese Remainder Theorem there are arbitrarily long runs of consecutive numbers that are not cubefree.
%C A349236 The first occurrence of a(n) = 1, 2, ... is at n = 1, 7, 68, 1145, 18825, 15003967, ...
%C A349236 The asymptotic density of the occurrences of 1 in this sequence is density(A340152)/density(A004709) =  A340153/A088453 = 0.8136635872...
%H A349236 Amiram Eldar, <a href="/A349236/b349236.txt">Table of n, a(n) for n = 1..10000</a>
%H A349236 Michael J. Mossinghoff, Tomás Oliveira e Silva, and Tim Trudgian, <a href="https://doi.org/10.1090/mcom/3581">The distribution of k-free numbers</a>, Mathematics of Computation, Vol. 90, No. 328 (2021), pp. 907-929; <a href="https://arxiv.org/abs/1912.04972">arXiv preprint</a>, arXiv:1912.04972 [math.NT], 2019-2020.
%F A349236 Asymptotic mean: lim_{n->oo} (1/n) Sum_{k=1..n} a(k) = zeta(3) (A002117).
%e A349236 a(1) = A004709(2) - A004709(1) = 2 - 1 = 1.
%e A349236 a(7) = A004709(8) - A004709(7) = 9 - 7 = 2.
%t A349236 cubeFreeQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], # < 3 &]; Differences @ Select[Range[100], cubeFreeQ]
%o A349236 (PARI)
%o A349236 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A349236 isA004709(n) = issquarefree(A003557(n));
%o A349236 A349236list(first_n) = { my(v=vector(first_n),k=0,e=1); for(n=2,oo,if(isA004709(n),k++; v[k] = n-e; e = n); if(#v==k, return(v))); }; \\ _Antti Karttunen_, Nov 11 2021
%Y A349236 Cf. A002117, A046099, A004709, A076259, A088453, A271443, A340152, A340153.
%K A349236 nonn
%O A349236 1,7
%A A349236 _Amiram Eldar_, Nov 11 2021

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE