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.

Previous Showing 11-11 of 11 results.

A349236 Gaps between cubefree numbers: a(n) = A004709(n+1) - A004709(n).

Original entry on oeis.org

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, 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, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Nov 11 2021

Keywords

Comments

This sequence is unbounded since by the Chinese Remainder Theorem there are arbitrarily long runs of consecutive numbers that are not cubefree.
The first occurrence of a(n) = 1, 2, ... is at n = 1, 7, 68, 1145, 18825, 15003967, ...
The asymptotic density of the occurrences of 1 in this sequence is density(A340152)/density(A004709) = A340153/A088453 = 0.8136635872...

Examples

			a(1) = A004709(2) - A004709(1) = 2 - 1 = 1.
a(7) = A004709(8) - A004709(7) = 9 - 7 = 2.
		

Crossrefs

Programs

  • Mathematica
    cubeFreeQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], # < 3 &]; Differences @ Select[Range[100], cubeFreeQ]
  • PARI
    A003557(n) = (n/factorback(factorint(n)[, 1]));
    isA004709(n) = issquarefree(A003557(n));
    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

Formula

Asymptotic mean: lim_{n->oo} (1/n) Sum_{k=1..n} a(k) = zeta(3) (A002117).
Previous Showing 11-11 of 11 results.