A376311 -id:A376311 - cp's OEIS frontend

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

-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

A376590 Second differences of consecutive squarefree numbers (A005117). First differences of A076259.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Oct 01 2024

sign

			The squarefree numbers (A005117) are:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, ...
with first differences (A076259):
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, ...
with first differences (A376590):
  0, 1, -1, 0, 2, -2, 1, -1, 0, 1, 0, 0, -1, 0, 2, 0, -2, 0, 1, -1, 0, 1, -1, 0, 1, ...

The version for A000002 is A376604, first differences of A054354.
The first differences were A076259, see also A375927, A376305, A376306, A376307, A376311.
Zeros are A376591, complement A376592.
Sorted positions of first appearances are A376655.
A000040 lists the prime numbers, differences A001223.
A001597 lists perfect-powers, complement A007916.
A005117 lists squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
A333254 lists run-lengths of differences between consecutive primes.
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376593 (nonsquarefree), A376596 (prime-power inclusive), A376599 (non-prime-power inclusive).
For squarefree numbers: A076259 (first differences), A376591 (inflections and undulations), A376592 (nonzero curvature), A376655 (sorted first positions).
Cf. A000961, A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A251092, A373198, A376342.

Differences[Select[Range[100],SquareFreeQ],2]

from math import isqrt
from sympy import mobius
def A376590(n):
    def iterfun(f,n=0):
        m, k = n, f(n)
        while m != k: m, k = k, f(k)
        return m
    def f(x): return n+x-sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))
    a = iterfun(f,n)
    b = iterfun(lambda x:f(x)+1,a)
    return a+iterfun(lambda x:f(x)+2,b)-(b<<1) # Chai Wah Wu, Oct 02 2024

A377046 Array read by downward antidiagonals where A(n,k) is the n-th term of the k-th differences of nonsquarefree numbers.

Original entry on oeis.org

4, 8, 4, 9, 1, -3, 12, 3, 2, 5, 16, 4, 1, -1, -6, 18, 2, -2, -3, -2, 4, 20, 2, 0, 2, 5, 7, 3, 24, 4, 2, 2, 0, -5, -12, -15, 25, 1, -3, -5, -7, -7, -2, 10, 25, 27, 2, 1, 4, 9, 16, 23, 25, 15, -10, 28, 1, -1, -2, -6, -15, -31, -54, -79, -94, -84, 32, 4, 3, 4, 6, 12, 27, 58, 112, 191, 285, 369

Offset: 0

Gus Wiseman, Oct 19 2024

Row k is the k-th differences of A013929.

			Array form:
        n=1:  n=2:  n=3:  n=4:  n=5:  n=6:  n=7:  n=8:  n=9:
  ---------------------------------------------------------
  k=0:   4     8     9    12    16    18    20    24    25
  k=1:   4     1     3     4     2     2     4     1     2
  k=2:  -3     2     1    -2     0     2    -3     1    -1
  k=3:   5    -1    -3     2     2    -5     4    -2     4
  k=4:  -6    -2     5     0    -7     9    -6     6    -7
  k=5:   4     7    -5    -7    16   -15    12   -13    10
  k=6:   3   -12    -2    23   -31    27   -25    23   -13
  k=7: -15    10    25   -54    58   -52    48   -36    13
  k=8:  25    15   -79   112  -110   100   -84    49     1
  k=9: -10   -94   191  -222   210  -184   133   -48   -57
Triangle form:
   4
   8   4
   9   1  -3
  12   3   2   5
  16   4   1  -1  -6
  18   2  -2  -3  -2   4
  20   2   0   2   5   7   3
  24   4   2   2   0  -5 -12 -15
  25   1  -3  -5  -7  -7  -2  10  25
  27   2   1   4   9  16  23  25  15 -10
  28   1  -1  -2  -6 -15 -31 -54 -79 -94 -84
  32   4   3   4   6  12  27  58 112 191 285 369

Initial rows: A013929, A078147, A376593.
The version for primes is A095195, noncomposites A376682, composites A377033.
A version for partitions is A175804, cf. A053445, A281425, A320590.
For squarefree numbers we have A377038, sums A377039, absolute A377040.
Triangle row-sums are A377047, absolute version A377048.
Column n = 1 is A377049, for squarefree A377041, for prime A007442 or A030016.
First position of 0 in each row is A377050.
For prime-power instead of nonsquarefree we have A377051.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers.
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
Cf. A000961, A007674, A053797, A053806, A061398, A072284, A112925, A120992, A376311, A376591, A376592.

nn=9;
t=Table[Take[Differences[NestList[NestWhile[#+1&,#+1,SquareFreeQ[#]&]&,4,2*nn],k],nn],{k,0,nn}]
Table[t[[j,i-j+1]],{i,nn},{j,i}]

A(i,j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) A013929(i+k).

A377038 Array read by antidiagonals downward where A(n,k) is the n-th term of the k-th differences of the squarefree numbers.

Original entry on oeis.org

1, 2, 1, 3, 1, 0, 5, 2, 1, 1, 6, 1, -1, -2, -3, 7, 1, 0, 1, 3, 6, 10, 3, 2, 2, 1, -2, -8, 11, 1, -2, -4, -6, -7, -5, 3, 13, 2, 1, 3, 7, 13, 20, 25, 22, 14, 1, -1, -2, -5, -12, -25, -45, -70, -92, 15, 1, 0, 1, 3, 8, 20, 45, 90, 160, 252, 17, 2, 1, 1, 0, -3, -11, -31, -76, -166, -326, -578

Offset: 0

Gus Wiseman, Oct 18 2024

Row n is the k-th differences of A005117 = the squarefree numbers.

			Array form:
        n=1:  n=2:  n=3:  n=4:  n=5:  n=6:  n=7:  n=8:  n=9:
  ----------------------------------------------------------
  k=0:   1     2     3     5     6     7    10    11    13
  k=1:   1     1     2     1     1     3     1     2     1
  k=2:   0     1    -1     0     2    -2     1    -1     0
  k=3:   1    -2     1     2    -4     3    -2     1     1
  k=4:  -3     3     1    -6     7    -5     3     0    -2
  k=5:   6    -2    -7    13   -12     8    -3    -2     3
  k=6:  -8    -5    20   -25    20   -11     1     5    -5
  k=7:   3    25   -45    45   -31    12     4   -10    10
  k=8:  22   -70    90   -76    43    -8   -14    20   -19
  k=9: -92   160  -166   119   -51    -6    34   -39    28
Triangle form:
   1
   2   1
   3   1   0
   5   2   1   1
   6   1  -1  -2  -3
   7   1   0   1   3   6
  10   3   2   2   1  -2  -8
  11   1  -2  -4  -6  -7  -5   3
  13   2   1   3   7  13  20  25  22
  14   1  -1  -2  -5 -12 -25 -45 -70 -92
  15   1   0   1   3   8  20  45  90 160 252

Row k=0 is A005117.
Row k=1 is A076259.
Row k=2 is A376590.
The version for primes is A095195, noncomposites A376682, composites A377033.
A version for partitions is A175804, cf. A053445, A281425, A320590.
Triangle row-sums are A377039, absolute version A377040.
Column n = 1 is A377041, for primes A007442 or A030016.
First position of 0 in each row is A377042.
For nonsquarefree instead of squarefree numbers we have A377046.
For prime-powers instead of squarefree numbers we have A377051.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
Cf. A007674, A053797, A053806, A061398, A072284, A075526, A112925, A112926, A120992, A373198, A376311, A376591, A376592.

nn=9;
t=Table[Take[Differences[NestList[NestWhile[#+1&,#+1,!SquareFreeQ[#]&]&,1,2*nn],k],nn],{k,0,nn}]
Table[t[[j,i-j+1]],{i,nn},{j,i}]

A(i,j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) A005117(i+k).

A377049 First term of the n-th differences of the nonsquarefree numbers. Inverse zero-based binomial transform of A013929.

Original entry on oeis.org

4, 4, -3, 5, -6, 4, 3, -15, 25, -10, -84, 369, -1067, 2610, -5824, 12246, -24622, 47577, -88233, 155962, -259086, 393455, -512281, 456609, 191219, -2396571, 8213890, -21761143, 50923029, -110269263, 225991429, -444168664, 844390152, -1561482492, 2817844569

Offset: 0

Gus Wiseman, Oct 19 2024

sign

Harvey P. Dale, Table of n, a(n) for n = 0..400

The version for primes is A007442, noncomposites A030016, composites A377036.
For squarefree instead of nonsquarefree numbers we have A377041.
For antidiagonal-sums we have A377047, absolute A377048.
For first position of 0 in each row we have A377050.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147, seconds A376593.
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
Cf. A007674, A053797, A053806, A061398, A072284, A075526, A084758, A112925, A120992, A251092, A376311, A376591.

nn=20;
Table[First[Differences[NestList[NestWhile[#+1&, #+1,SquareFreeQ[#]&]&,4,2*nn],k]],{k,0,nn}]
With[{nsf=Select[Range[1000],!SquareFreeQ[#]&]},Table[Differences[nsf,n],{n,0,40}]][[;;,1]] (* Harvey P. Dale, Nov 28 2024 *)

The inverse zero-based binomial transform of a sequence (q(0), q(1), q(2), ...) is the sequence p given by:

p(j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) q(k)

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]]]

A377047 Antidiagonal-sums of the array A377046(n,k) = n-th term of k-th differences of nonsquarefree numbers (A013929).

Original entry on oeis.org

4, 12, 7, 22, 14, 17, 39, 0, 37, 112, -337, 1103, -2570, 5868, -12201, 24670, -47528, 88283, -155910, 259140, -393399, 512341, -456546, -191155, 2396639, -8213818, 21761218, -50922953, 110269343, -225991348, 444168748, -844390064, 1561482582, -2817844477

Offset: 1

Gus Wiseman, Oct 19 2024

sign

These are the row-sums of the triangle-version of A377046.

			The third antidiagonal of A377046 is (9, 1, -3), so a(3) = 7.

The version for primes is A140119, noncomposites A376683, composites A377034.
For squarefree instead of nonsquarefree numbers we have A377039.
The absolute value version is A377048.
For leading column we have A377049.
For first position of 0 in each row we have A377050.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147, seconds A376593.
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A376311, A376591, A376592, A377051.

nn=20;
t=Table[Take[Differences[NestList[NestWhile[#+1&,#+1,SquareFreeQ[#]&]&,4,2*nn],k],nn],{k,0,nn}];
Total/@Table[t[[j,i-j+1]],{i,nn},{j,i}]

A376591 Inflection and undulation points in the sequence of squarefree numbers (A005117).

Original entry on oeis.org

1, 4, 9, 11, 12, 14, 16, 18, 21, 24, 27, 32, 33, 35, 40, 43, 48, 53, 55, 56, 58, 62, 65, 68, 71, 79, 84, 87, 96, 98, 99, 101, 103, 107, 110, 113, 118, 120, 121, 123, 128, 131, 134, 137, 142, 144, 145, 147, 152, 153, 155, 158, 163, 165, 166, 172, 175, 179, 184

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

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

			The squarefree numbers (A005117) are:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, ...
with first differences (A076259):
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, ...
with first differences (A376590):
  0, 1, -1, 0, 2, -2, 1, -1, 0, 1, 0, 0, -1, 0, 2, 0, -2, 0, 1, -1, 0, 1, -1, 0, 1, ...
with zeros at (A376591):
 1, 4, 9, 11, 12, 14, 16, 18, 21, 24, 27, 32, 33, 35, 40, 43, 48, 53, 55, 56, 58, ...

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

The first differences were A076259, see also A375927, A376305, A376306, A376307, A376311.
These are the zeros of A376590.
The complement is A376592.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
For inflections and undulations: A064113 (prime), A376602 (composite), A376588 (non-perfect-power), A376594 (nonsquarefree), A376597 (prime-power), A376600 (non-prime-power).
For squarefree numbers: A076259 (first differences), A376590 (second differences), A376592 (nonzero curvature).
Cf. A007674, A036263, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A333254, A376593, A376655.

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

A377050 Position of first appearance of zero in the n-th differences of the nonsquarefree numbers, or 0 if it does not appear.

Original entry on oeis.org

0, 0, 5, 11, 4, 129, 10, 89, 16, 161, 72, 77325, 71, 4870, 70, 253, 75, 737923, 166, 1648316, 165, 8753803, 164, 208366710, 163, 99489971, 162, 49493333, 161

Offset: 0

Gus Wiseman, Oct 19 2024

If a(29) is not 0, then it is > 10^12. - Lucas A. Brown, Oct 25 2024

			The fourth differences of A013929 begin: -6, -2, 5, 0, -7, 9, -6, 6, -7, ... so a(4) = 4.

Lucas A. Brown, Python program.

The version for primes is A376678, noncomposites A376855, composites A377037.
For squarefree instead of nonsquarefree numbers we have A377042.
For antidiagonal-sums we have A377047, absolute A377048.
For leading column we have A377049.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147, seconds A376593.
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
Cf. A000961, A007674, A053797, A053806, A061398, A072284, A084758, A112925, A120992, A376311, A376591, A377051.

nn=10000;
u=Table[Differences[Select[Range[nn],!SquareFreeQ[#]&],k],{k,2,16}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
m=Table[Position[u[[k]],0][[1,1]],{k,mnrm[Union[First/@Position[u,0]]]}]

a(17)-a(28) from Lucas A. Brown, Oct 25 2024

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]]]

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A376590 Second differences of consecutive squarefree numbers (A005117). First differences of A076259.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Python

A377046 Array read by downward antidiagonals where A(n,k) is the n-th term of the k-th differences of nonsquarefree numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A377038 Array read by antidiagonals downward where A(n,k) is the n-th term of the k-th differences of the squarefree numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A377049 First term of the n-th differences of the nonsquarefree numbers. Inverse zero-based binomial transform of A013929.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377047 Antidiagonal-sums of the array A377046(n,k) = n-th term of k-th differences of nonsquarefree numbers (A013929).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376591 Inflection and undulation points in the sequence of squarefree numbers (A005117).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A377050 Position of first appearance of zero in the n-th differences of the nonsquarefree numbers, or 0 if it does not appear.

Views

Author