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.

Showing 1-8 of 8 results.

A045882 Smallest term of first run of (at least) n consecutive integers which are not squarefree.

Original entry on oeis.org

4, 8, 48, 242, 844, 22020, 217070, 1092747, 8870024, 221167422, 221167422, 47255689915, 82462576220, 1043460553364, 79180770078548, 3215226335143218, 23742453640900972, 125781000834058568
Offset: 1

Views

Author

Keywords

Comments

Solution for n=10 is same as for n=11.
This sequence is infinite and each term initiates a suitable arithmetic progression with large differences like squares of primorials or other suitable products of primes from prime factors being on power 2 in terms and in chains after. Proof includes solution of linear Diophantine equations and math. induction. See also A068781, A070258, A070284, A078144, A049535, A077640, A077647, A078143 of which first terms are recollected here. - Labos Elemer, Nov 25 2002

Examples

			a(3) = 48 as 48, 49 and 50 are divisible by squares.
n=5 -> {844=2^2*211; 845=5*13^2; 846=2*3^2*47; 847=7*11^2; 848=2^4*53}.
		

References

  • J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 242, p. 67, Ellipses, Paris 2008.

Crossrefs

Cf. A013929, A053806, A049535, A077647, A078143. Also A069021 and A051681 are different versions.

Programs

  • Mathematica
    cnt = 0; k = 0; Table[While[cnt < n, k++; If[! SquareFreeQ[k], cnt++, cnt = 0]]; k - n + 1, {n, 7}]
  • PARI
    a(n)=my(s);for(k=1,9^99,if(issquarefree(k),s=0,if(s++==n,return(k-n+1)))) \\ Charles R Greathouse IV, May 29 2013

Formula

a(n) = 1 + A020754(n+1). - R. J. Mathar, Jun 25 2010
Correction from Jeppe Stig Nielsen, Mar 05 2022: (Start)
a(n) = 1 + A020754(n+1) for 1 <= n < 11.
a(n) = 1 + A020754(n) for 11 <= n < N where N is unknown.
Possibly a(n) = 1 + A020754(n-d) for some higher n, depending on how many repeated terms the sequence has. (End)
a(n) <= A061742(n) = A002110(n)^2 is the trivial bound obtained from the CRT. - Charles R Greathouse IV, Sep 06 2022

Extensions

a(9)-a(11) from Patrick De Geest, Nov 15 1998, Jan 15 1999
a(12)-a(15) from Louis Marmet (louis(AT)marmet.org) and David Bernier (ezcos(AT)yahoo.com), Nov 15 1999
a(16) was obtained as a result of a team effort by Z. McGregor-Dorsey et al. [Louis Marmet (louis(AT)marmet.org), Jul 27 2000]
a(17) was obtained as a result of a team effort by E. Wong et al. [Louis Marmet (louis(AT)marmet.org), Jul 13 2001]
a(18) was obtained as a result of a team effort by L. Marmet et al.

A049535 Starts of runs of exactly 6 consecutive nonsquarefree numbers.

Original entry on oeis.org

22020, 24647, 30923, 47672, 55447, 57120, 73447, 74848, 96675, 105772, 121667, 121847, 152339, 171348, 179972, 182347, 185247, 190447, 200848, 204323, 215303, 229172, 233223, 234375, 240424, 268223, 274547, 310120, 327424, 338920
Offset: 1

Views

Author

Keywords

Examples

			Squares dividing the numbers in the starting at 22020 are 4, 361, 121, 9, 4, 25, respectively.
		

Crossrefs

The smallest members of such strings of length k are listed in A045882.
Cf. A001694 powerful numbers, A013929 not squarefree.
Cf. A045882 (min terms), A068781 (2-chains), A070258 (3-chains), A070284 (4-chains), A078144 (5-chains), A049535 (6-chains), A077640 (7-chains), A077647 (8-chains), A078143 (9-chains), A268313 (10-chains), A268314 (11-chains).

Programs

  • Maple
    Res:= NULL:
    st:= 0:
    for n from 1 to 500000 do
      if numtheory:-issqrfree(n) then
        if st = 6 then Res:= Res, n-6 fi;
        st:= 0;
      else
        st:= st+1;
      fi
    od:
    Res; # Robert Israel, Feb 08 2017
  • Mathematica
    Select[Range[400000], !SquareFreeQ[#] && !SquareFreeQ[#+1] && !SquareFreeQ[#+2] && !SquareFreeQ[#+3] && !SquareFreeQ[#+4] && !SquareFreeQ[#+5] && SquareFreeQ[#+6]&] (* Vladimir Joseph Stephan Orlovsky, Mar 30 2011 *)
    Flatten[Position[Partition[SquareFreeQ/@Range[60000],6,1],?(Union[#] == {False}&),{1},Heads->False]] (* _Harvey P. Dale, May 24 2014 *)

Formula

{ A078144(k) | A078144(k+1) = A078144(k)+1 and A078144(k+2) > A078144(k)+2 }. - M. F. Hasler, Feb 01 2016

Extensions

Definition corrected by Donald S. McDonald, Nov 07 2002
Corrected by Robert Israel, Feb 08 2017

A077647 Smallest term of a run of at least 8 consecutive integers which are not squarefree.

Original entry on oeis.org

1092747, 7216618, 8870024, 8870025, 14379271, 22635347, 24816974, 25047846, 33678771, 33908368, 33908369, 34394371, 34682346, 37923938, 49250144, 49250145, 53379270, 69147868, 69147869, 70918820, 70918821, 71927247, 72913022, 83605071, 85972019, 90571646
Offset: 1

Views

Author

Labos Elemer, Nov 18 2002

Keywords

Examples

			n=8870024: squares dividing n+j (j=0...8) i.e. 9 consecutive integers are as follows {4,25,121,841,4,49,961,9,16}
		

Crossrefs

Cf. A045882 (first k-chain), A068781 (2-chains), A070258 (3-chains), A070284 (4-chains), A078144 (5-chains), A049535 (6-chains), A077640 (7-chains), A077647 (8-chains), A078143 (9-chains), A268313 (10-chains), A268314 (11-chains).

Programs

  • Mathematica
    s8[x_] := Apply[Plus, Table[Abs[MoebiusMu[x+j]], {j, 0, 7}]]; Do[If[s8[n] == 0, Print[n]], {n, 10^8}]
    Flatten[Position[Partition[SquareFreeQ/@Range[91000000],8,1],_?(Union[#]=={False}&),{1},Heads->False]]
  • PARI
    for(n=1,10^8,forstep(k=7,0,-1,issquarefree(n+k)&&(n+=k)&&next(2));print1(n",")) \\ M. F. Hasler, Feb 03 2016

Formula

A077647 = { A077640[k] | A077640[k+1] = A077640[k]+1 }. - M. F. Hasler, Feb 01 2016

A078143 Smallest term of a run of at least 9 consecutive integers which are not squarefree.

Original entry on oeis.org

8870024, 33908368, 49250144, 69147868, 70918820, 111500620, 112931372, 164786748, 167854344, 200997948, 203356712, 207543320, 211014920, 216785256, 221167422, 221167423, 221167424, 236645624, 240574368, 262315467, 262315468
Offset: 1

Views

Author

Labos Elemer, Nov 22 2002

Keywords

Comments

The sequence includes an infinite family of arithmetic progressions. Such AP's can be constructed to each term, with large differences [like squares of primorials, A061742(7)]. It is necessary to solve suitable systems of linear Diophantine equations. E.g.: arithmetic progression subsequences of starting 9-chains is {mk+69147868+j} where j=0..8, m=510510^2 because square prime factors of a(4)+j=68147868+j are 4, 49, 121, 169, 4, 9, 289, 25, 4 resp. for j=0..8; k goes to infinity; 7th primorial is sufficient, 9th is not necessary. Construction is provable for arbitrary long [>9] chains. - Labos Elemer, Nov 25 2002
More precisely, if in one run {a(n)+j, j=0..8} the maximum smallest square factor is p^2, then an infinite subsequence is given by {a(n)+(p#)^2*k, k=0..oo}, where p# = A034386(p). One may get a smaller step taking the least L^2 which has a square factor in common with each of the 9 consecutive terms. - M. F. Hasler, Feb 03 2016

Crossrefs

Cf. A013929, A045882 (first of the k-chains), A051681.
Cf. A068781 (2-chains), A070258 (3-chains), A070284 (4-chains), A078144 (5-chains), A049535 (6-chains), A077640 (7-chains), A077647 (8-chains), A078143 (9-chains), A268313 (10-chains), A268314 (11-chains).

Programs

  • Mathematica
    s9[x_] := Apply[Plus, Table[Abs[MoebiusMu[x+j]], {j, 0, 8}]]; Do[If[Equal[s9[n], 0], Print[n]], {n, 8000000, 1000000000}]
  • PARI
    is(n)=for(i=n,n+8, if(!issquarefree(i), return(0))); 1 \\ Charles R Greathouse IV, Nov 05 2017

Formula

A078143 = { A077647[k] | A077647[k+1] = A077647[k]+1 } = { A077640[k] | A077640[k+2] = A077640[k]+2 } = { A078144[k] | A078144[k+4] = A078144[k]+4 } etc. Note that A049535 is defined differently. - M. F. Hasler, Feb 01 2016
a(n) < 4666864390*n. With more work this bound can be decreased significantly. - Charles R Greathouse IV, Nov 05 2017

Extensions

a(6)-a(21) from Donovan Johnson, Nov 26 2008

A268313 First term of a run of at least 10 consecutive integers which are not squarefree.

Original entry on oeis.org

221167422, 221167423, 262315467, 363504972, 463239475, 1202800371, 1407472722, 1407472723, 1557947844, 1609077723, 1911823144, 2217728772, 2695179044, 2737800168, 2847305571, 3639720042, 3639720043, 3672883247, 3865964268, 3865964269, 3982659575, 4246929267, 4818537743, 4982931368
Offset: 1

Views

Author

M. F. Hasler, Feb 01 2016

Keywords

Crossrefs

Cf. A013929, A045882 (first of the k-chains), A051681.
Cf. A068781 (2-chains), A070258 (3-chains), A070284 (4-chains), A078144 (5-chains), A049535 (6-chains), A077640 (7-chains), A077647 (8-chains), A078143 (9-chains), A268314 (11-chains).

Programs

  • Mathematica
    s10[x_] := Apply[Plus, Table[Abs[MoebiusMu[x+j]], {j, 0, 9}]]; Do[If[Equal[s10[n], 0], Print[n]], {n, 10^8, 10^10}]

Formula

A268313 = { A078143[k] | A078143[k+1] = A078143[k]+1 } = { A077647[k] | A077647[k+2] = A077647[k]+2 } = { A077640[k] | A077640[k+3] = A077640[k]+3 }.

A268314 First term of a run of at least 11 consecutive integers which are not squarefree.

Original entry on oeis.org

221167422, 1407472722, 3639720042, 3865964268, 4982931368, 5005996146, 7108776620, 8044261244, 10249558974, 12766690268, 13585489166, 19792784322, 26995377572, 30410811296, 30477326444, 32070270968, 34317891368, 39956560824, 40841363528, 42216508746, 43133805944, 46295514872, 47255689915
Offset: 1

Views

Author

M. F. Hasler, Feb 01 2016

Keywords

Comments

a(23) is the first term beginning a 12-chain. - Bill Hannaford, Oct 06 2016

Crossrefs

Cf. A013929, A045882 (first of the k-chains), A051681.
Cf. A068781 (2-chains), A070258 (3-chains), A070284 (4-chains), A078144 (5-chains), A049535 (6-chains), A077640 (7-chains), A077647 (8-chains), A078143 (9-chains), A268313 (10-chains).

Programs

  • Mathematica
    s11[x_] := Apply[Plus, Table[Abs[MoebiusMu[x+j]], {j, 0, 10}]]; Do[If[Equal[s11[n], 0], Print[n]], {n, 10^8, 10^13}]

Formula

A268314 = { A268313[k] | A268313[k+1] = A268313[k]+1 } = { A078143[k] | A078143[k+2] = A078143[k]+2 } = { A077647[k] | A077647[k+3] = A077647[k]+3 } = { A077640[k] | A077640[k+4] = A077640[k]+4 }.

Extensions

a(12)-a(23) from Bill Hannaford, Oct 06 2016

A188347 Central element of a series of 7 successive nonsquarefree numbers.

Original entry on oeis.org

217073, 671349, 826827, 1092750, 1092751, 1427373, 2097051, 2779373, 3112822, 3306447, 3597726, 3994823, 4063777, 4442877, 4630547, 4842477, 5436378, 5479622, 5610647, 5634125, 6315022, 6474223, 6626322, 6677867, 7128474, 7216621, 7216622, 7295451, 7507926
Offset: 1

Views

Author

Keywords

Comments

Each of a(n), a(n)-1, a(n)-2, a(n)-3, a(n)+1, a(n)+2, a(n)+3 has at least one square divisor.

Examples

			217073=17*113^2, 217073-1=2^4*13567, 217073-2=3^2*89*271, 217073-3=2*5*7^2*443, 217073+1=2*3*11^2*13*23, 217073+2=5^2*19*457, 217073+3=2^2*54269.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[200000,5000000], !SquareFreeQ[#] &&!SquareFreeQ[#-1] &&!SquareFreeQ[#+1] &&!SquareFreeQ[#-2] &&!SquareFreeQ[#+2] &&!SquareFreeQ[#-3] &&!SquareFreeQ[#+3]&]

Formula

a(n) = A077640(n) + 3. - Amiram Eldar, Feb 09 2021

Extensions

More terms from Carl Najafi, Aug 22 2011

A268270 Least prime that is at distance > n from the nearest squarefree number.

Original entry on oeis.org

2, 17, 727, 47527, 29002021, 494501773, 44633461423, 7489886099881
Offset: 0

Views

Author

Keywords

Examples

			a(0)=2 is the least prime and it is at distance 1 from the nearest squarefree numbers (1 and/or 3).
a(1)=17 is the least prime that has no squarefree neighbor: both 16 and 18 are divisible by a square; the nearest squarefree numbers, 15 and 19, are both at distance 2.
a(2)=727 is the least prime p such that p-2 and p+1 are (two consecutive terms) in A068781, namely A068781(75..76).
a(3)=47527 is the least prime p such that p-3 and p+1 are (two consecutive terms) in A070258, namely A070258(878..879).
a(4)=29002021 is the least prime p such that p-4 and p+1 are (two consecutive terms) in A070284.
a(5)=494501773 is the least prime p such that p-5 and p+1 are (two consecutive terms) in A078144.
Similarly, for n = 6, 7, 8 and 9, a(n) is the least prime p such that p-n and p+1 are (two consecutive terms) in A049535, A077640, A077647 and A078143, respectively.
		

Crossrefs

Programs

  • PARI
    a(n)=forprime(p=n,,for(s=1,n,(issquarefree(p-s)||issquarefree(p+s)) && next(2)); return(p))

Extensions

a(4) corrected and a(5) computed by Christopher E. Thompson, Jan 20 2016
a(6)-a(7) from Bert Dobbelaere, Jan 28 2019
Showing 1-8 of 8 results.