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 31-40 of 41 results. Next

A376595 Points of nonzero curvature in the sequence of nonsquarefree numbers (A013929).

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 18, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 38, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 73, 74, 75, 77, 78, 79, 80, 84, 85, 86, 87, 89, 90, 91
Offset: 1

Views

Author

Gus Wiseman, Oct 04 2024

Keywords

Comments

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

Examples

			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 nonzeros (A376594) at:
  1, 2, 3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 18, 21, 22, 23, 24, 26, 27, 28, 29, 30, ...
		

Crossrefs

The first differences were A078147.
These are the nonzeros of A376593.
The complement is A376594.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A114374 counts integer partitions into nonsquarefree numbers.
For points of nonzero curvature: A333214 (prime), A376603 (composite), A376589 (non-perfect-power), A376592 (squarefree), A376598 (prime-power), A376601 (non-prime-power).
For nonsquarefree numbers: A078147 (first differences), A376593 (second differences), A376594 (inflections and undulations).

Programs

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

A333488 First index of weakly decreasing prime quartets.

Original entry on oeis.org

11, 15, 18, 24, 36, 39, 46, 47, 53, 54, 55, 58, 62, 72, 73, 87, 91, 101, 102, 106, 107, 110, 111, 114, 118, 127, 128, 129, 132, 146, 150, 157, 180, 186, 193, 199, 210, 217, 223, 228, 232, 239, 242, 259, 260, 263, 269, 270, 271, 274, 275, 282, 283, 284, 290
Offset: 1

Views

Author

Gus Wiseman, May 15 2020

Keywords

Comments

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) >= g(k + 1) >= g(k + 2).

Examples

			The first 10 weakly decreasing prime quartets:
   31  37  41  43
   47  53  59  61
   61  67  71  73
   89  97 101 103
  151 157 163 167
  167 173 179 181
  199 211 223 227
  211 223 227 229
  241 251 257 263
  251 257 263 269
For example, 241 is the 53rd prime, and the primes (241,251,257,263) have differences (10,6,6), which are weakly decreasing, so 53 is in the sequence.
		

Crossrefs

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime quartets are A054804.
Strictly increasing prime quartets are A054819.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488 (this sequence).
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Indices of weakly decreasing rows of A066099 are A114994.
Lengths of maximal weakly decreasing subsequences of prime gaps: A333212.
Lengths of maximal strictly increasing subsequences of prime gaps: A333253.

Programs

  • Mathematica
    ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x>=z-y>=t-z:>PrimePi[x]]

A377036 First term of the n-th differences of the composite numbers. Inverse zero-based binomial transform of A002808.

Original entry on oeis.org

4, 2, 0, -1, 2, -2, 0, 4, -8, 8, 0, -16, 32, -32, -1, 78, -233, 687, -2363, 8160, -25670, 72352, -184451, 430937, -933087, 1888690, -3597221, 6479696, -11086920, 18096128, -28307626, 42644791, -62031001, 86466285, -110902034, 110907489, -52325, -483682930
Offset: 0

Views

Author

Gus Wiseman, Oct 18 2024

Keywords

Crossrefs

The version for prime instead of composite is A007442.
For noncomposite numbers we have A030016.
This is the first column (n=1) of A377033.
For row-sums we have A377034, absolute version A377035.
First zero positions are A377037, cf. A376678, A376855, A377042, A377050, A377055.
For squarefree instead of composite we have A377041, nonsquarefree A377049.
For prime-power instead of composite we have A377054.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, seconds A036263.
A002808 lists the composite numbers, differences A073783, seconds A073445.
A008578 lists the noncomposites, differences A075526.
Cf: A018252, A065310, A065890, A140119, A173390, A333214, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680.

Programs

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

Formula

The inverse zero-based binomial transform of a sequence (q(0), q(1), ..., q(m)) is the sequence p given by:
p(j) = sum_{k=0..j} (-1)^(j-k) binomial(j,k) q(k)

A376601 Points of nonzero curvature in the sequence of non-prime-powers inclusive (A024619).

Original entry on oeis.org

1, 3, 4, 5, 6, 8, 12, 13, 16, 17, 19, 21, 23, 25, 27, 28, 32, 34, 35, 36, 37, 38, 40, 42, 46, 49, 53, 54, 60, 61, 63, 65, 67, 69, 71, 72, 78, 79, 81, 82, 83, 84, 85, 89, 91, 99, 101, 105, 106, 110, 111, 113, 115, 117, 118, 122, 124, 132, 134, 136, 138, 148
Offset: 1

Views

Author

Gus Wiseman, Oct 05 2024

Keywords

Comments

These are points at which the second differences (A376599) are nonzero.
Inclusive means 1 is a prime-power but not a non-prime-power. For the exclusive version, subtract 1 and shift left.

Examples

			The non-prime-powers inclusive (A024619) are:
  6, 10, 12, 14, 15, 18, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, ...
with first differences (A375735):
  4, 2, 2, 1, 3, 2, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, ...
with first differences (A376599):
  -2, 0, -1, 2, -1, -1, 0, 1, 0, 0, 0, 1, -2, 0, 0, 1, -1, 0, 1, 0, -1, 0, 1, 0, ...
with nonzero terms (A376601) at:
  1, 3, 4, 5, 6, 8, 12, 13, 16, 17, 19, 21, 23, 25, 27, 28, 32, 34, 35, 36, 37, ...
		

Crossrefs

For first differences we had A375735, ones A375713(n) - 1.
These are the nonzeros of A376599.
The complement is A376600.
A000961 lists prime-powers inclusive, exclusive A246655.
A007916 lists non-perfect-powers.
A024619/A361102 list non-prime-powers inclusive.
A057820 gives first differences of prime-powers inclusive.
A321346/A321378 count integer partitions into non-prime-powers, factorizations A322452.
For non-prime-powers: A375735/A375708 (first differences), A376599 (second differences), A376600 (inflections and undulations).
For nonzero curvature: A333214 (prime), A376603 (composite), A376588 (non-perfect-power), A376592 (squarefree), A376595 (nonsquarefree), A376598 (prime-power).

Programs

  • Mathematica
    Join@@Position[Sign[Differences[Select[Range[100], !(#==1||PrimePowerQ[#])&],2]],1|-1]

A335406 First position of n in the sequence of run-lengths of the sequence of prime gaps.

Original entry on oeis.org

1, 2, 49, 633353, 6706139
Offset: 1

Views

Author

Gus Wiseman, Jun 10 2020

Keywords

Comments

Prime gaps are differences between adjacent prime numbers.

Crossrefs

Positions of first appearances in A333254.
The unequal version is 7, 1, 4, 15, 10, 36, 5, 6, 84, ...
The weakly decreasing version is 1, 2, 7, 23, 26, ...
The weakly increasing version is 5, 2, 3, 1, 81, 193, ...
The strictly decreasing version is 1, 4, 8, 150, 160, ...
The strictly increasing version is 6, 1, 4, 38, 221, ...
Prime gaps are A001223.
The first term of the first length-n arithmetic progression of consecutive primes is A006560(n), with index A089180(n).
Positions of adjacent equal prime gaps are A064113.
Positions of adjacent unequal prime gaps are A333214.

Programs

  • Mathematica
    qe=Length/@Split[Differences[Array[Prime,10000]],SameQ];
    Table[Position[qe,i][[1,1]],{i,Union[qe]}]

Extensions

a(5) from Giovanni Resta, Jun 11 2020

A337504 Number of compositions of 2*n with n maximal anti-runs.

Original entry on oeis.org

1, 1, 3, 8, 13, 33, 112, 286, 769, 2288, 6695, 18745, 54654, 160888, 467402, 1362378, 4016517, 11807966, 34708018, 102451390, 302870005, 895207191, 2650590597, 7859253320, 23316653154, 69231883374, 205773157904, 612021943421, 1821435719846, 5424528040529, 16165017705176
Offset: 0

Views

Author

Gus Wiseman, Sep 04 2020

Keywords

Comments

An anti-run is a sequence with no adjacent equal parts.

Examples

			The a(0) = 1 through a(4) = 13 compositions:
  ()  (2)  (2,2)    (2,2,2)      (2,2,2,2)
           (1,1,2)  (1,1,1,3)    (1,1,1,1,4)
           (2,1,1)  (1,1,2,2)    (1,1,2,2,2)
                    (2,2,1,1)    (2,2,2,1,1)
                    (3,1,1,1)    (4,1,1,1,1)
                    (1,1,1,2,1)  (1,1,1,1,3,1)
                    (1,1,2,1,1)  (1,1,1,2,2,1)
                    (1,2,1,1,1)  (1,1,1,3,1,1)
                                 (1,1,2,2,1,1)
                                 (1,1,3,1,1,1)
                                 (1,2,2,1,1,1)
                                 (1,3,1,1,1,1)
                                 (2,1,1,1,1,2)
		

Crossrefs

A106356 has this as main diagonal n = 2*k.
A336108 is the version for runs.
A337505 is the version for patterns.
A337564 is the version for runs in patterns.
A003242 counts anti-run compositions.
A011782 counts compositions.
A124767 counts runs in standard compositions.
A238343 counts compositions by descents.
A333213 counts compositions by weak ascents.
A333381 counts anti-runs in standard compositions.
A333382 counts adjacent unequal pairs in standard compositions.
A333489 ranks anti-runs.
A333755 counts compositions by number of runs.
A333769 gives run-lengths in standard compositions.
A337565 gives anti-run lengths in standard compositions.

Programs

  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[2*n],Length[Split[#,UnsameQ]]==n&]],{n,0,10}]
  • PARI
    a(n)={polcoef(polcoef(1 - y + y*(y-1)/(y - 1 - sum(d=1, 2*n, (y-1)^d*x^d/(1 - x^d) + O(x^(2*n+1)))), 2*n, x), n, y)} \\ Andrew Howroyd, Feb 02 2021

Formula

a(n) = [x^(2*n)*y^n] 1 - y + y*(y-1)/(y - 1 - Sum_{d>=1} (y-1)^d*x^d/(1 - x^d)). - Andrew Howroyd, Feb 02 2021

Extensions

Terms a(11) and beyond from Andrew Howroyd, Feb 02 2021

A335277 First index of strictly increasing prime quartets.

Original entry on oeis.org

7, 13, 22, 28, 49, 60, 64, 69, 70, 75, 78, 85, 89, 95, 104, 116, 122, 123, 144, 148, 152, 155, 173, 178, 182, 195, 201, 206, 212, 215, 219, 225, 226, 230, 236, 237, 244, 253, 256, 257, 265, 288, 302, 307, 315, 325, 328, 329, 332, 333, 336, 348, 355, 361, 373
Offset: 1

Views

Author

Gus Wiseman, May 30 2020

Keywords

Comments

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) < g(k + 1) < g(k + 2).

Examples

			The first 10 strictly increasing prime quartets:
   17  19  23  29
   41  43  47  53
   79  83  89  97
  107 109 113 127
  227 229 233 239
  281 283 293 307
  311 313 317 331
  347 349 353 359
  349 353 359 367
  379 383 389 397
For example, 107 is the 28th prime, and the primes (107,109,113,127) have differences (2,4,14), which are strictly increasing, so 28 is in the sequence.
		

Crossrefs

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime quartets are A335278.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Lengths of maximal weakly decreasing sequences of prime gaps are A333212.
Lengths of maximal strictly increasing sequences of prime gaps are A333253.

Programs

  • Mathematica
    ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-xPrimePi[x]]

Formula

prime(a(n)) = A054819(n).

A335278 First index of strictly decreasing prime quartets.

Original entry on oeis.org

11, 18, 24, 47, 58, 62, 87, 91, 111, 114, 127, 132, 146, 150, 157, 180, 210, 223, 228, 232, 242, 259, 260, 263, 269, 274, 275, 282, 283, 284, 299, 300, 309, 321, 344, 350, 351, 363, 364, 367, 368, 369, 375, 378, 382, 388, 393, 399, 406, 409, 413, 431, 442, 446
Offset: 1

Views

Author

Gus Wiseman, May 30 2020

Keywords

Comments

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) > g(k + 1) > g(k + 2).

Examples

			The first 10 strictly decreasing prime quartets:
   31  37  41  43
   61  67  71  73
   89  97 101 103
  211 223 227 229
  271 277 281 283
  293 307 311 313
  449 457 461 463
  467 479 487 491
  607 613 617 619
  619 631 641 643
For example, 211 is the 47th prime, and the primes (211,223,227,229) have differences (12,4,2), which are strictly decreasing, so 47 is in the sequence.
		

Crossrefs

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly increasing prime quartets are A335277.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Indices of strictly decreasing rows of A066099 are A333256.
Lengths of maximal weakly increasing sequences of prime gaps are A333215.
Lengths of maximal strictly decreasing sequences of prime gaps are A333252.

Programs

  • Mathematica
    ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x>z-y>t-z:>PrimePi[x]]

Formula

prime(a(n)) = A054804(n).

A373817 Positions of terms > 1 in the run-lengths of the first differences of the odd primes.

Original entry on oeis.org

2, 14, 34, 36, 42, 49, 66, 94, 98, 100, 107, 117, 147, 150, 169, 171, 177, 181, 199, 219, 250, 268, 315, 333, 361, 392, 398, 435, 477, 488, 520, 565, 570, 585, 592, 595, 628, 642, 660, 666, 688, 715, 744, 765, 772, 778, 829, 842, 897, 906, 931, 932, 961, 1025
Offset: 1

Views

Author

Gus Wiseman, Jun 23 2024

Keywords

Comments

Positions of terms > 1 in A333254. In other words, the a(n)-th run of differences of odd primes has length > 1.

Examples

			Primes 54 to 57 are {251, 257, 263, 269}, with differences (6,6,6). This is the 49th run, and the first of length > 2.
		

Crossrefs

Positions of adjacent equal prime gaps are A064113.
Positions of adjacent unequal prime gaps are A333214.
Positions of terms > 1 in A333254, run-lengths A373821, firsts A335406.
A000040 lists the primes, differences A001223.
A027833 gives antirun lengths of odd primes, run-lengths A373820.
A046933 counts composite numbers between primes.
A065855 counts composite numbers up to n.
A071148 gives partial sums of odd primes.

Programs

  • Mathematica
    Join@@Position[Length /@ Split[Differences[Select[Range[1000],PrimeQ]]] // Most,x_Integer?(#>1&)]

A376656 Sorted positions of first appearances in the second differences (A036263) of consecutive primes (A000040).

Original entry on oeis.org

1, 2, 3, 4, 9, 10, 29, 30, 33, 34, 96, 98, 99, 154, 179, 180, 189, 216, 217, 242, 262, 294, 296, 428, 429, 446, 708, 756, 834, 1005, 1182, 1229, 1663, 1830, 1831, 1846, 1879, 2191, 2224, 2343, 2809, 3077, 3086, 3384, 3385, 3427, 3643, 3644, 3793, 3795, 4230
Offset: 1

Views

Author

Gus Wiseman, Oct 07 2024

Keywords

Comments

The prime numbers are (A000040):
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, ...
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, ...
with second differences (A036263):
1, 0, 2, -2, 2, -2, 2, 2, -4, 4, -2, -2, 2, 2, 0, -4, 4, -2, -2, 4, -2, 2, 2, ...
with sorted first appearances at (A376656):
1, 2, 3, 4, 9, 10, 29, 30, 33, 34, 96, 98, 99, 154, 179, 180, 189, 216, 217, ...

Crossrefs

These are the sorted positions of first appearances in A036263.
For first differences we had A373400(n) + 1, except initial terms.
For prime-powers instead of prime numbers we have A376653/A376654.
For squarefree instead of prime numbers we have A376655, sorted firsts of A376590.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, complement A013929 (differences A078147).
A333254 lists run-lengths of differences between consecutive primes.
For second differences: A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376593 (nonsquarefree), A376596 (prime-power inclusive), A376599 (non-prime-power inclusive).

Programs

  • Mathematica
    q=Differences[Select[Range[1000],PrimeQ],2];
    Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]
Previous Showing 31-40 of 41 results. Next