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.

Previous Showing 11-20 of 25 results. Next

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

A376340 Sorted positions of first appearances in A057820, the sequence of first differences of prime-powers.

Original entry on oeis.org

1, 4, 9, 12, 18, 24, 34, 47, 60, 79, 117, 178, 198, 206, 215, 244, 311, 402, 465, 614, 782, 1078, 1109, 1234, 1890, 1939, 1961, 2256, 2290, 3149, 3377, 3460, 3502, 3722, 3871, 4604, 4694, 6634, 8073, 8131, 8793, 12370, 12661, 14482, 14990, 15912, 17140, 19166
Offset: 1

Views

Author

Gus Wiseman, Sep 22 2024

Keywords

Examples

			The terms together with their prime indices begin:
     1: {}
     4: {1,1}
     9: {2,2}
    12: {1,1,2}
    18: {1,2,2}
    24: {1,1,1,2}
    34: {1,7}
    47: {15}
    60: {1,1,2,3}
    79: {22}
   117: {2,2,6}
   178: {1,24}
   198: {1,2,2,5}
   206: {1,27}
   215: {3,14}
   244: {1,1,18}
		

Crossrefs

For compression instead of sorted firsts we have A376308.
For run-lengths instead of sorted firsts we have A376309.
For run-sums instead of sorted firsts we have A376310.
The version for squarefree numbers is the unsorted version of A376311.
The unsorted version is A376341.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A024619 and A361102 list non-prime-powers, first differences A375708.
A116861 counts partitions by compressed sum, by compressed length A116608.

Programs

  • Mathematica
    q=Differences[Select[Range[100],PrimePowerQ]];
    Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

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

A377040 Antidiagonal-sums of absolute value of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Original entry on oeis.org

1, 3, 4, 9, 13, 18, 28, 39, 106, 267, 595, 1212, 2286, 4041, 6720, 10497, 15387, 20914, 25894, 29377, 37980, 70785, 175737, 343806, 579751, 861934, 1162080, 1431880, 1688435, 2589533, 8731932, 23911101, 58109574, 130912573, 276067892, 543833014, 992784443
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Examples

			The fourth antidiagonal of A377038 is (6, 1, -1, -2, -3), so a(4) = 13.
		

Crossrefs

The version for primes is A376681, noncomposites A376684, composites A377035.
These are the antidiagonal-sums of the absolute value of A377038.
The non-absolute version is A377039.
For nonsquarefree numbers we have A377048, non-absolute A377047.
For prime-powers we have A377053, non-absolute A377052.
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.
A377041 gives first column of A377038, for primes A007442 or A030016.
A377042 gives first position of 0 in each row of A377038.

Programs

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

A376592 Points of nonzero curvature in the sequence of squarefree numbers (A005117).

Original entry on oeis.org

2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 30, 31, 34, 36, 37, 38, 39, 41, 42, 44, 45, 46, 47, 49, 50, 51, 52, 54, 57, 59, 60, 61, 63, 64, 66, 67, 69, 70, 72, 73, 74, 75, 76, 77, 78, 80, 81, 82, 83, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95
Offset: 1

Views

Author

Gus Wiseman, Oct 04 2024

Keywords

Comments

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

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, ...
with nonzeros at (A376591):
  2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 30, 31, 34, 36, ...
		

Crossrefs

The first differences were A076259, see also A375927, A376305, A376306, A376307, A376311.
These are the nonzeros of A376590.
The complement is A376591.
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 points of nonzero curvature: A333214 (prime), A376603 (composite), A376589 (non-perfect-power), A376595 (nonsquarefree), A376598 (prime-power), A376601 (non-prime-power).
For squarefree numbers: A076259 (first differences), A376590 (second differences), A376591 (inflection and undulation points).

Programs

  • Mathematica
    Join@@Position[Sign[Differences[Select[Range[100], SquareFreeQ],2]],1|-1]

A377039 Antidiagonal-sums of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Original entry on oeis.org

1, 3, 4, 9, 1, 18, 8, -9, 106, -237, 595, -1170, 2276, -3969, 6640, -10219, 14655, -18636, 19666, -12071, -13056, 69157, -171441, 332756, -552099, 798670, -982472, 901528, -116173, -2351795, 8715186, -23856153, 57926066, -130281007, 273804642, -535390274
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Comments

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

Examples

			The fourth antidiagonal of A377038 is (6,1,-1,-2,-3), so a(4) = 1.
		

Crossrefs

The version for primes is A140119, noncomposites A376683, composites A377034.
These are the antidiagonal-sums of A377038.
The absolute version is A377040.
For nonsquarefree numbers we have A377047.
For prime-powers we have A377052.
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.
A377041 gives first column of A377038, for primes A007442 or A030016.
A377042 gives first position of 0 in each row of A377038.

Programs

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

A377042 Position of first zero in the n-th differences of the squarefree numbers (A005117), or 0 if it does not appear.

Original entry on oeis.org

0, 0, 1, 11, 8, 57, 14, 11, 13, 1019, 44, 1250, 43, 2721, 42, 249522, 2840, 1989839, 2839, 3373774, 4933, 142715511, 42793, 435650856, 5266, 30119361, 104063, 454172978707, 100285, 434562125244, 2755089, 2409925829164, 2485612
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Comments

a(n) for n even appear to be smaller than a(n) for n odd. - Chai Wah Wu, Oct 19 2024
a(33) > 10^13, unless it is 0. - Lucas A. Brown, Nov 15 2024

Examples

			The fourth differences begin: -3, 3, 1, -6, 7, -5, 3, 0, -2, ... so a(4) = 8
		

Crossrefs

The version for primes is A376678, noncomposites A376855, composites A377037.
This is the first position of 0 in each row of A377038.
For nonsquarefree numbers we have A377050.
For prime-powers we have A377055.
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.
A377039 gives antidiagonal-sums of A377038, absolute version A377040.
A377041 gives first column of A377038, for primes A007442 or A030016.

Programs

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

Extensions

a(15)-a(20) from Chai Wah Wu, Oct 19 2024
a(21)-a(32) from Lucas A. Brown, Nov 15 2024

A376342 Positions of 1's in the run-compression (A376305) of the first differences (A076259) of the squarefree numbers (A005117).

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 22, 24, 26, 28, 30, 32, 34, 36, 38, 41, 43, 45, 47, 49, 51, 54, 56, 58, 60, 62, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 124, 126, 128, 130
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 squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
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, ...
with run-compression (A376305):
  1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 2, 1, 2, 1, ...
with ones at (A376342):
  1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 22, 24, 26, 28, 30, 32, 34, 36, 38, ...
		

Crossrefs

Before compressing we had A076259.
Positions of 1's in A376305.
The version for nonsquarefree numbers gives positions of ones in A376312.
For prime instead of squarefree numbers we have A376343.
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.
A274174 counts contiguous compositions, ranks A374249.

Programs

  • Mathematica
    Join@@Position[First /@ Split[Differences[Select[Range[100],SquareFreeQ]]],1]

A377041 First term of the n-th differences of the squarefree numbers. Inverse zero-based binomial transform of A005117.

Original entry on oeis.org

1, 1, 0, 1, -3, 6, -8, 3, 22, -92, 252, -578, 1189, -2255, 3991, -6617, 10245, -14626, 18666, -19635, 12104, 13090, -69122, 171478, -332718, 552138, -798629, 982514, -901485, 116219, 2351842, -8715135, 23856206, -57926011, 130281064, -273804584, 535390333
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Crossrefs

The version for primes is A007442, noncomposites A030016, composites A377036.
This is the first column of A377038.
For nonsquarefree numbers we have A377049.
For prime-powers we have A377054.
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.
A377042 gives first position of 0 in each row of A377038.

Programs

  • Mathematica
    q=Select[Range[100],SquareFreeQ];
    t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[1+k]],{k,0,j}],{j,0,Length[q]/2}]

Formula

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)

A376341 Position of first appearance of n in A057820, the sequence of first differences of prime-powers, or 0 if n does not appear.

Original entry on oeis.org

1, 5, 10, 13, 19, 25, 199, 35, 118, 48, 28195587, 61, 3745011205066703, 80, 6635, 312, 1079, 207, 3249254387600868788, 179, 43580, 216, 21151968922, 615, 762951923, 403, 1962, 466, 12371, 245, 1480223716, 783, 494890212533313, 1110, 2064590, 1235, 375744164943287809536
Offset: 1

Views

Author

Gus Wiseman, Sep 22 2024

Keywords

Comments

For odd n either a(n) or a(n)+1 is in A024622 (unless a(n) = 0), corresponding to cases where the smaller or the larger term in the pair of consecutive prime powers, respectively, is a power of 2. - Pontus von Brömssen, Sep 27 2024

Examples

			a(4) = 13, because the first occurrence of 4 in A057820 is at index 13. The corresponding first pair of consecutive prime powers with difference 4 is (19, 23), and a(4) = A025528(23) = 13.
a(61) = A024622(96), because the first pair of consecutive prime powers with difference 61 is (2^96, 2^96+61), and A025528(2^96+61) = A024622(96).
		

Crossrefs

For compression instead of first appearances we have A376308.
For run-lengths instead of first appearances we have A376309.
For run-sums instead of first appearances we have A376310.
For squarefree numbers instead of prime-powers we have A376311.
The sorted version is A376340.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A024619 and A361102 list non-prime-powers, first differences A375708.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
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[100],#==1||PrimePowerQ[#]&]];
    Table[Position[q,k][[1,1]],{k,mnrm[q]}]

Formula

A057820(a(n)) = n whenever a(n) > 0. - Pontus von Brömssen, Sep 24 2024

Extensions

Definition modified by Pontus von Brömssen, Sep 26 2024
More terms from Pontus von Brömssen, Sep 27 2024
Previous Showing 11-20 of 25 results. Next