A375707 -id:A375707 - cp's OEIS frontend

A068781 Lesser of two consecutive numbers each divisible by a square.

8, 24, 27, 44, 48, 49, 63, 75, 80, 98, 99, 116, 120, 124, 125, 135, 147, 152, 168, 171, 175, 188, 207, 224, 242, 243, 244, 260, 275, 279, 288, 296, 315, 324, 332, 342, 343, 350, 351, 360, 363, 368, 375, 387, 404, 423, 424, 440, 459, 475, 476, 495, 507, 512

Offset: 1

Robert G. Wilson v, Mar 04 2002

nonn

Also numbers m such that mu(m)=mu(m+1)=0, where mu is the Moebius-function (A008683); A081221(a(n))>1. - Reinhard Zumkeller, Mar 10 2003
The sequence contains an infinite family of arithmetic progressions like {36a+8}={8,44,80,116,152,188,...} ={4(9a+2)}. {36a+9} provides 2nd nonsquarefree terms. Such AP's can be constructed to any term by solution of a system of linear Diophantine equation. - Labos Elemer, Nov 25 2002
1. 4k^2 + 4k is a member for all k; i.e., 8 times a triangular number is a member. 2. (4k+1) times an odd square - 1 is a member. 3. (4k+3) times odd square is a member. - Amarnath Murthy, Apr 24 2003
The asymptotic density of this sequence is 1 - 2/zeta(2) + Product_{p prime} (1 - 2/p^2) = 1 - 2 * A059956 + A065474 = 0.1067798952... (Matomäki et al., 2016). - Amiram Eldar, Feb 14 2021
Maximum of the n-th maximal anti-run of nonsquarefree numbers (A013929) differing by more than one. For runs instead of anti-runs we have A376164. For squarefree instead of nonsquarefree we have A007674. - Gus Wiseman, Sep 14 2024

			44 is in the sequence because 44 = 2^2 * 11 and 45 = 3^2 * 5.
From _Gus Wiseman_, Sep 14 2024: (Start)
Splitting nonsquarefree numbers into maximal anti-runs gives:
  (4,8)
  (9,12,16,18,20,24)
  (25,27)
  (28,32,36,40,44)
  (45,48)
  (49)
  (50,52,54,56,60,63)
  (64,68,72,75)
  (76,80)
  (81,84,88,90,92,96,98)
  (99)
The maxima are a(n). The corresponding pairs are (8,9), (24,25), (27,28), (44,45), etc.
(End)

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Kaisa Matomäki, Maksym Radziwiłł and Terence Tao, Sign patterns of the Liouville and Möbius functions, Forum of Mathematics, Sigma, Vol. 4. (2016), e14.

Cf. A068780, A068140, A068781, A068782, A068783, A068784, A068785.
Cf. A049535, A077647, A078143, A045882.
Subsequence of A261869.
Cf. A007674, A373409, A373410, A373412, A375707, A376164.
A005117 lists the squarefree numbers, first differences A076259.
A013929 lists the nonsquarefree numbers, first differences A078147.
A053797 gives lengths of runs of nonsquarefree numbers, firsts A373199.
Cf. A049094, A061399, A072284, A120992, A294242, A373573, A375709.

a068781 n = a068781_list !! (n-1)
a068781_list = filter ((== 0) . a261869) [1..]
-- Reinhard Zumkeller, Sep 04 2015

Select[ Range[2, 600], Max[ Transpose[ FactorInteger[ # ]] [[2]]] > 1 && Max[ Transpose[ FactorInteger[ # + 1]] [[2]]] > 1 &]
f@n_:= Flatten@Position[Partition[SquareFreeQ/@Range@2000,n,1], Table[False,{n}]]; f@2 (* Hans Rudolf Widmer, Aug 30 2022 *)
Max/@Split[Select[Range[100], !SquareFreeQ[#]&],#1+1!=#2&]//Most (* Gus Wiseman, Sep 14 2024 *)

isok(m) = !moebius(m) && !moebius(m+1); \\ Michel Marcus, Feb 14 2021

A261869(a(n)) = 0. - Reinhard Zumkeller, Sep 04 2015

A376593 Second differences of consecutive nonsquarefree numbers (A013929). First differences of A078147.

Original entry on oeis.org

-3, 2, 1, -2, 0, 2, -3, 1, -1, 3, 0, 0, 0, -3, 2, -2, 0, 1, 0, 0, 2, -1, -2, 3, 0, -1, -2, 3, -3, 2, 1, -2, 0, 2, -2, -1, 0, 3, 0, 0, 0, -3, 2, -2, 2, -2, 0, 1, 2, -1, -2, 3, 0, -1, -2, 1, 0, -1, 2, 1, -2, 0, 2, -3, 1, -1, 2, -2, 3, 0, 0, -3, 2, 1, -2, 0, 2

Offset: 1

Gus Wiseman, Oct 01 2024

sign

The range is {-3, -2, -1, 0, 1, 2, 3}.

			The nonsquarefree numbers (A013929) are:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, 52, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, 4, 4, ...
with first differences (A376593):
  -3, 2, 1, -2, 0, 2, -3, 1, -1, 3, 0, 0, 0, -3, 2, -2, 0, 1, 0, 0, 2, -1, -2, ...

The version for A000002 is A376604, first differences of A054354.
The first differences were A078147.
Zeros are A376594, complement A376595.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, differences A076259.
A064113 lists positions of adjacent equal prime gaps.
A114374 counts partitions into nonsquarefree numbers.
A246655 lists prime-powers exclusive, inclusive A000961.
A333254 lists run-lengths of differences between consecutive primes.
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376596 (prime-power inclusive), A376599 (non-prime-power inclusive).
For nonsquarefree numbers: A013929 (terms), A078147 (first differences), A376594 (inflections and undulations), A376595 (nonzero curvature).
Cf. A061398, A053797, A053806, A120992, A182853, A251092, A373198, A375707, A376305, A376306, A376311, A376312, A376655.

Differences[Select[Range[100],!SquareFreeQ[#]&],2]

from math import isqrt
from sympy import mobius, factorint
def A376593(n):
    def f(x): return n+sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))
    m, k = n, f(n)
    while m != k: m, k = k, f(k)
    k = next(i for i in range(1,5) if any(d>1 for d in factorint(m+i).values()))
    return next(i for i in range(1-k,5-k) if any(d>1 for d in factorint(m+(k<<1)+i).values())) # Chai Wah Wu, Oct 02 2024

A376311 Position of first appearance of n in the sequence of first differences of squarefree numbers, or the sequence ends if there is none.

Original entry on oeis.org

1, 3, 6, 31, 150, 515, 13391, 131964, 664313, 5392318, 159468672, 134453711, 28728014494, 50131235121, 634347950217, 48136136076258, 1954623227727573, 14433681032814706, 76465679305346797

Offset: 1

Gus Wiseman, Sep 22 2024

			The sequence of squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
The sequence of first differences (A076259) of squarefree numbers is:
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, ...
The positions of first appearances are a(n).

This is the position of first appearance of n in A076259, ones A375927.
For compression instead of positions of first appearances we have A376305.
For run-lengths instead of first appearances we have A376306.
For run-sums instead of first appearances we have A376307.
For prime-powers instead of squarefree numbers we have A376341.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A120992, A375707, A376312, A376342.

mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
q=Differences[Select[Range[10000],SquareFreeQ]];
Table[Position[q,k][[1,1]],{k,mnrm[q]}]

a(11)-a(19) from Amiram Eldar, Sep 24 2024

A375927 Numbers k such that A005117(k+1) - A005117(k) = 1. In other words, the k-th squarefree number is 1 less than the next.

Original entry on oeis.org

1, 2, 4, 5, 7, 9, 10, 14, 15, 18, 19, 21, 22, 24, 25, 27, 28, 30, 35, 36, 38, 40, 41, 43, 44, 46, 48, 49, 51, 53, 54, 58, 59, 62, 63, 65, 66, 68, 69, 71, 72, 74, 76, 79, 80, 82, 84, 85, 87, 88, 90, 94, 96, 97, 101, 102, 105, 107, 108, 110, 111, 113, 114, 116

Offset: 1

Gus Wiseman, Sep 12 2024

nonn

The asymptotic density of this sequence is Product_{p prime} (1 - 1/(p^2-1)) = 0.53071182... (A065469). - Amiram Eldar, Sep 15 2024

			The squarefree numbers are 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ... which first increase by one after terms 1, 2, 4, 5, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000

Positions of 1's in A076259.
For prime-powers (A246655) we have A375734.
First differences are A373127.
For nonsquarefree instead of squarefree we have A375709.
For nonprime numbers we have A375926, differences A373403.
For composite numbers we have A375929.
The complement is A375930, differences A120992.
A005117 lists the squarefree numbers, first differences A076259.
A013929 lists the nonsquarefree numbers, first differences A078147.
A053797 gives lengths of runs of nonsquarefree numbers, firsts A373199.
A375707 counts squarefree numbers between consecutive nonsquarefree numbers.
Cf. A007674, A061399, A065469, A072284, A110969, A294242, A373409, A373410, A373573.

Join@@Position[Differences[Select[Range[100],SquareFreeQ[#]&]],1]

lista(kmax) = {my(is1 = 1, is2, c = 1); for(k = 2, kmax, is2 = issquarefree(k); if(is2, c++); if(is1 && is2, print1(c-1, ", ")); is1 = is2);} \\ Amiram Eldar, Sep 15 2024

A376305 Run-compression of the sequence of first differences of squarefree numbers.

Original entry on oeis.org

1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 2, 4, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 4, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 2, 3, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3

Offset: 1

Gus Wiseman, Sep 20 2024

nonn

We define the run-compression of a sequence to be the anti-run obtained by reducing each run of repeated parts to a single part. Alternatively, run-compression removes all parts equal to the part immediately to their left. For example, (1,1,2,2,1) has run-compression (1,2,1).

			The sequence of squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
The sequence of first differences (A076259) of squarefree numbers is:
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, ...
The run-compression is A376305 (this sequence).

This is the run-compression of first differences of A005117.
For prime instead of squarefree numbers we have A037201, halved A373947.
Before compressing we had A076259, ones A375927.
For run-lengths instead of compression we have A376306.
For run-sums instead of compression we have A376307.
For prime-powers instead of squarefree numbers we have A376308.
For positions of first appearances instead of compression we have A376311.
The version for nonsquarefree numbers is A376312.
Positions of 1's are A376342.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A003242 counts compressed or anti-run compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
A274174 counts contiguous compositions, ranks A374249.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A274174, A373197, A373198, A375707, A375708.

First/@Split[Differences[Select[Range[100],SquareFreeQ]]]

A376306 Run-lengths of the sequence of first differences of squarefree numbers.

Original entry on oeis.org

2, 1, 2, 1, 1, 1, 2, 3, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 3, 2, 1, 1, 1

Offset: 1

Gus Wiseman, Sep 21 2024

nonn

			The sequence of squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
The sequence of first differences (A076259) of squarefree numbers is:
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, ...
with runs:
  (1,1),(2),(1,1),(3),(1),(2),(1,1),(2,2,2),(1,1),(3,3),(1,1),(2),(1,1), ...
with lengths A376306 (this sequence).

Run-lengths of first differences of A005117.
Before taking run-lengths we had A076259, ones A375927.
For prime instead of squarefree numbers we have A333254.
For compression instead of run-lengths we have A376305.
For run-sums instead of run-lengths we have A376307.
For prime-powers instead of squarefree numbers we have A376309.
For positions of first appearances instead of run-lengths we have A376311.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A003242 counts compressed or anti-run compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
A274174 counts contiguous compositions, ranks A374249.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A373198, A375707, A376312.

Length/@Split[Differences[Select[Range[100],SquareFreeQ]]]

A376312 Run-compression of first differences (A078147) of nonsquarefree numbers (A013929).

Original entry on oeis.org

4, 1, 3, 4, 2, 4, 1, 2, 1, 4, 1, 3, 1, 2, 4, 3, 1, 4, 3, 1, 4, 1, 3, 4, 2, 4, 2, 1, 4, 1, 3, 1, 3, 1, 2, 4, 3, 1, 4, 3, 1, 2, 1, 3, 4, 2, 4, 1, 2, 1, 3, 1, 4, 1, 3, 4, 2, 4, 3, 1, 4, 1, 3, 4, 2, 4, 2, 1, 3, 2, 4, 1, 3, 4, 2, 3, 1, 3, 1, 4, 1, 3, 2, 1, 3, 4, 2

Offset: 1

Gus Wiseman, Sep 24 2024

nonn

We define the run-compression of a sequence to be the anti-run obtained by reducing each run of repeated parts to a single part. Alternatively, we can remove all parts equal to the part immediately to their left. For example, (1,1,2,2,1) has run-compression (1,2,1).

			The sequence of nonsquarefree numbers (A013929) is:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, ...
with runs:
  (4),(1),(3),(4),(2,2),(4),(1),(2),(1),(4,4,4,4),(1),(3),(1,1),(2,2,2), ...
and run-compression (A376312):
  4, 1, 3, 4, 2, 4, 1, 2, 1, 4, 1, 3, 1, 2, 4, 3, 1, 4, 3, 1, 4, 1, 3, 4, ...

For nonprime instead of squarefree numbers we have A037201, halved A373947.
Before compressing we had A078147.
For run-sums instead of compression we have A376264.
For squarefree instead of nonsquarefree we have A376305, ones A376342.
For prime-powers instead of nonsquarefree numbers we have A376308.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259 (ones A375927).
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
Cf. A007674, A053797, A053806, A072284, A112925, A120992, A274174, A373198, A375707, A376306, A376307, A376311.

First/@Split[Differences[Select[Range[100], !SquareFreeQ[#]&]]]

A376307 Run-sums of the sequence of first differences of squarefree numbers.

Original entry on oeis.org

2, 2, 2, 3, 1, 2, 2, 6, 2, 6, 2, 2, 2, 2, 2, 2, 2, 3, 1, 4, 6, 2, 2, 1, 3, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 6, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 3, 1, 3, 1, 4, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 6, 2, 6, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 2, 6, 2, 2, 1, 3

Offset: 1

Gus Wiseman, Sep 21 2024

nonn

			The sequence of squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
The sequence of first differences (A076259) of squarefree numbers is:
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, ...
with runs:
  (1,1),(2),(1,1),(3),(1),(2),(1,1),(2,2,2),(1,1),(3,3),(1,1),(2),(1,1), ...
with sums A376307 (this sequence).

Run-sums of first differences of A005117.
Before taking run-sums we had A076259, ones A375927.
For the squarefree numbers themselves we have A373413.
For prime instead of squarefree numbers we have A373822, halved A373823.
For compression instead of run-sums we have A376305, ones A376342.
For run-lengths instead of run-sums we have A376306.
For prime-powers instead of squarefree numbers we have A376310.
For positions of first appearances instead of run-sums we have A376311.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A003242 counts compressed or anti-run compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
A274174 counts contiguous compositions, ranks A374249.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A373197, A373198, A375707.

Total/@Split[Differences[Select[Range[100],SquareFreeQ]]]

A375709 Numbers k such that A013929(k+1) = A013929(k) + 1. In other words, the k-th nonsquarefree number is 1 less than the next nonsquarefree number.

Original entry on oeis.org

2, 8, 10, 15, 17, 18, 24, 28, 30, 37, 38, 43, 45, 47, 48, 52, 56, 59, 65, 67, 69, 73, 80, 85, 92, 93, 94, 100, 106, 108, 111, 115, 122, 125, 128, 133, 134, 137, 138, 141, 143, 145, 148, 153, 158, 165, 166, 171, 178, 183, 184, 192, 196, 198, 203, 205, 207, 210

Offset: 1

Gus Wiseman, Sep 01 2024

nonn

The difference of consecutive nonsquarefree numbers is at least 1 and at most 4, so there are four disjoint sequences of this type:
- A375709 (difference 1) (this)
- A375710 (difference 2)
- A375711 (difference 3)
- A375712 (difference 4)

			The initial nonsquarefree numbers are 4, 8, 9, 12, 16, 18, 20, 24, 25, which first increase by one after the 2nd and 8th terms.

Positions of 1's in A078147.
For prime-powers (A246655) we have A375734.
First differences are A373409.
For prime numbers we have A375926.
For squarefree instead of nonsquarefree we have A375927.
A005117 lists the squarefree numbers, first differences A076259.
A013929 lists the nonsquarefree numbers, first differences A078147.
A053797 gives lengths of runs of nonsquarefree numbers, firsts A373199.
A375707 counts squarefree numbers between consecutive nonsquarefree numbers.
Cf. A007674, A049094, A061399, A068781, A072284, A110969, A120992, A294242, A373410, A373573.

Join@@Position[Differences[Select[Range[100],!SquareFreeQ[#]&]],1]

Complement of A375710 U A375711 U A375712.

A376594 Inflection and undulation points in the sequence of nonsquarefree numbers (A013929).

Original entry on oeis.org

5, 11, 12, 13, 17, 19, 20, 25, 33, 37, 39, 40, 41, 47, 53, 57, 62, 70, 71, 76, 81, 82, 83, 88, 92, 93, 96, 98, 103, 109, 113, 118, 123, 130, 131, 133, 137, 139, 146, 149, 154, 155, 156, 161, 165, 168, 169, 174, 179, 180, 183, 187, 188, 189, 193, 201, 211, 213

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

These are points at which the second differences (A376593) are zero.

			The nonsquarefree numbers (A013929) are:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, 52, 54, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, 4, 4, 3, ...
with first differences (A376593):
  -3, 2, 1, -2, 0, 2, -3, 1, -1, 3, 0, 0, 0, -3, 2, -2, 0, 1, 0, 0, 2, -1, -2, 3, ...
with zeros (A376594) at:
  5, 11, 12, 13, 17, 19, 20, 25, 33, 37, 39, 40, 41, 47, 53, 57, 62, 70, 71, 76, ...

Gus Wiseman, Inflection and undulation points in the nonsquarefree numbers.

The first differences were A078147.
These are the zeros of A376593.
The complement is A376595.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A064113 lists positions of adjacent equal prime gaps.
A114374 counts partitions into nonsquarefree numbers.
For inflections and undulations: A064113 (prime), A376602 (composite), A376588 (non-perfect-power), A376597 (prime-power), A376600 (non-prime-power).
For nonsquarefree numbers: A013929 (terms), A078147 (first differences), A376593 (second differences), A376595 (nonzero curvature).
Cf. A007674, A053797, A053806, A061398, A112926, A120992, A251092, A375707, A376312, A376590, A376593.

Join@@Position[Differences[Select[Range[100],!SquareFreeQ[#]&],2],0]

cp's OEIS Frontend

A068781 Lesser of two consecutive numbers each divisible by a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A376593 Second differences of consecutive nonsquarefree numbers (A013929). First differences of A078147.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A376311 Position of first appearance of n in the sequence of first differences of squarefree numbers, or the sequence ends if there is none.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions

A375927 Numbers k such that A005117(k+1) - A005117(k) = 1. In other words, the k-th squarefree number is 1 less than the next.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A376305 Run-compression of the sequence of first differences of squarefree numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376306 Run-lengths of the sequence of first differences of squarefree numbers.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A376312 Run-compression of first differences (A078147) of nonsquarefree numbers (A013929).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376307 Run-sums of the sequence of first differences of squarefree numbers.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A375709 Numbers k such that A013929(k+1) = A013929(k) + 1. In other words, the k-th nonsquarefree number is 1 less than the next nonsquarefree number.

Views