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.

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

Views

Author

Gus Wiseman, Oct 01 2024

Keywords

Examples

			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, ...
		

Crossrefs

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).

Programs

  • Mathematica
    Differences[Select[Range[100],SquareFreeQ],2]
  • Python
    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

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

Views

Author

Gus Wiseman, Sep 22 2024

Keywords

Examples

			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).
		

Crossrefs

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.

Programs

  • Mathematica
    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]}]

Extensions

a(11)-a(19) from Amiram Eldar, Sep 24 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

Views

Author

Gus Wiseman, Sep 20 2024

Keywords

Comments

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).

Examples

			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).
		

Crossrefs

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.

Programs

  • Mathematica
    First/@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

Views

Author

Gus Wiseman, Sep 24 2024

Keywords

Comments

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).

Examples

			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, ...
		

Crossrefs

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.

Programs

  • Mathematica
    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

Views

Author

Gus Wiseman, Sep 21 2024

Keywords

Examples

			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).
		

Crossrefs

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.

Programs

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

A376655 Sorted positions of first appearances in the second differences of consecutive squarefree numbers (A005117).

Original entry on oeis.org

1, 2, 3, 5, 6, 30, 61, 150, 514, 1025, 5153, 13390, 13391, 131964, 502651, 664312, 4387185, 5392318, 20613826
Offset: 1

Views

Author

Gus Wiseman, Oct 07 2024

Keywords

Comments

Warning: Do not confuse with A246655 (prime-powers exclusive).

Examples

			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, ...
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, ...
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, ...
with sorted first appearances at (A376655):
  1, 2, 3, 5, 6, 30, 61, 150, 514, 1025, 5153, 13390, 13391, ...
		

Crossrefs

For first differences we had A376311 (first appearances in A076259).
These are the sorted positions of first appearances in A376590.
For prime-powers instead of squarefree numbers we have A376653/A376654.
For primes instead of squarefree numbers we have A376656.
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 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: A376591 (inflections and undulations), A376592 (nonzero curvature).

Programs

  • Mathematica
    q=Differences[Select[Range[1000],SquareFreeQ],2];
    Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

Extensions

a(14)-a(19) from Chai Wah Wu, Oct 07 2024

A376343 Positions of twos in the run-compressed (A037201) first differences (A001223) of the primes (A000040).

Original entry on oeis.org

2, 4, 6, 9, 12, 15, 18, 24, 26, 31, 33, 37, 39, 41, 44, 47, 50, 53, 57, 62, 73, 75, 81, 90, 95, 99, 102, 105, 108, 127, 129, 131, 135, 139, 156, 158, 161, 163, 167, 173, 182, 187, 190, 193, 196, 205, 210, 214, 216, 232, 235, 241, 244, 247, 254, 263, 265, 270
Offset: 1

Views

Author

Gus Wiseman, Sep 26 2024

Keywords

Comments

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).

Examples

			The sequence of prime numbers (A000040) is:
  2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, ...
with first differences (A001223):
  1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, ...
with run-compression (A037201):
  1, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, ...
with twos at (A376343):
  2, 4, 6, 9, 12, 15, 18, 24, 26, 31, 33, 37, 39, 41, 44, 47, 50, 53, 57, 62, 73, ...
		

Crossrefs

Positions of 2's in A037201.
The repeats were at positions A064113 before being omitted.
A variation for squarefree numbers is A376342.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A005117 lists squarefree numbers, differences A076259 (ones A375927).
A013929 lists nonsquarefree numbers, differences A078147.
A333254 lists run-lengths of differences between consecutive primes.

Programs

  • Mathematica
    Join@@Position[First/@Split[Differences[Select[Range[100],PrimeQ]]],2]

Formula

For just the odd primes we have a(n) - 1.

A376266 Sorted positions of first appearances in A376264 (run-sums of first differences of nonsquarefree numbers).

Original entry on oeis.org

1, 2, 3, 8, 10, 14, 18, 53, 1437, 6222, 40874
Offset: 1

Views

Author

Gus Wiseman, Sep 27 2024

Keywords

Examples

			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), ...
with sums (A376264):
  4, 1, 3, 4, 4, 4, 1, 2, 1, 16, 1, 3, 2, 6, 4, 3, 1, 8, 3, 1, 4, 1, 3, 4, 4, ...
with first appearances at (A376266):
  1, 2, 3, 8, 10, 14, 18, 53, 1437, 6222, 40874, ...
		

Crossrefs

These are the positions of first appearances in A376264.
The unsorted version is A376265.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A005117 lists squarefree numbers, differences A076259 (ones A375927).
A013929 lists nonsquarefree numbers, differences A078147.
A333254 lists run-lengths of differences between consecutive primes.
A376267 gives run-lengths of first differences of nonsquarefree numbers.
A376312 gives run-compression of first differences of nonsquarefree numbers.
A376305 gives run-compression of differences of squarefree numbers, ones A376342.

Programs

  • Mathematica
    q=Total/@Split[Differences[Select[Range[10000], !SquareFreeQ[#]&]]]//Most;
    Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]
Showing 1-8 of 8 results.