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-4 of 4 results.

A376265 Position of first appearance of n in A376264 (run-sums of first differences of nonsquarefree numbers), or 0 if there are none.

Original entry on oeis.org

2, 8, 3, 1, 6222, 14, 308540, 18
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 (A376265):
  2, 8, 3, 1, 6222, 14, 308540, 18, ...
		

Crossrefs

This is the position of first appearance of n in A376264.
The sorted version is A376266.
For run-lengths instead of firsts of run-sums we have A376267.
For compression instead of firsts of run-sums we have A376312.
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.
A333254 lists run-lengths of differences between consecutive primes.
A376305 gives run-compression of first differences of squarefree numbers.
A376307 gives run-sums of first differences of squarefree numbers.

Programs

  • Mathematica
    mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
    q=Total/@Split[Differences[Select[Range[10000],!SquareFreeQ[#]&]]]//Most;
    Table[Position[q,k][[1,1]],{k,mnrm[q]}]

Formula

A376264(a(n)) = n.

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[[#]]]&]

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[#]&]]]

A376267 Run-lengths of first differences (A078147) of nonsquarefree numbers (A013929).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2
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 lengths (A376267):
  1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, ...
		

Crossrefs

For prime instead of nonsquarefree numbers we have A333254.
For run-sums instead of run-lengths we have A376264.
For squarefree instead of nonsquarefree we have A376306.
For prime-powers instead of nonsquarefree numbers we have A376309.
For compression instead of run-lengths we have A376312.
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.

Programs

  • Maple
    nsf:= remove(numtheory:-issqrfree, [$4..1000]):
    S:= nsf[2..-1]-nsf[1..-2]:
    R:= NULL: x:= 4: t:= 1:
    for i from 2 to nops(S) do
      if S[i] = x then t:= t+1
      else R:= R,t; x:= S[i]; t:= 1
      fi
    od:
    R; # Robert Israel, Jan 27 2025
  • Mathematica
    Length/@Split[Differences[Select[Range[1000], !SquareFreeQ[#]&]]]//Most
Showing 1-4 of 4 results.