A333214 -id:A333214 - cp's OEIS frontend

A342050 Numbers k which have an odd number of trailing zeros in their primorial base representation A049345(k).

2, 4, 8, 10, 14, 16, 20, 22, 26, 28, 30, 32, 34, 38, 40, 44, 46, 50, 52, 56, 58, 60, 62, 64, 68, 70, 74, 76, 80, 82, 86, 88, 90, 92, 94, 98, 100, 104, 106, 110, 112, 116, 118, 120, 122, 124, 128, 130, 134, 136, 140, 142, 146, 148, 150, 152, 154, 158, 160, 164, 166, 170, 172, 176, 178, 180, 182, 184, 188, 190, 194, 196, 200, 202, 206, 208, 212

Offset: 1

Amiram Eldar, Feb 26 2021

Numbers k such that A276084(k) is odd.
All the terms are even since odd numbers have 0 trailing zeros, and 0 is not odd.
The number of terms not exceeding A002110(m) for m>=1 is A002110(m) * Sum_{k=1..m}(-1)^k/A002110(k) = 1, 2, 11, 76, 837, 10880, 184961, ...
The asymptotic density of this sequence is Sum_{k>=1} (-1)^(k+1)/A002110(k) = 0.362306... (A132120).
Also Heinz numbers of partitions with even least gap. The least gap (mex or minimal excludant) of a partition is the least positive integer that is not a part. The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions. - Gus Wiseman, Apr 23 2021
Numbers k such that A000720(A053669(k)) is even. Differences from the related A353531 seem to be terms that are multiples of 210, but not all of them, for example primorial 30030 (= 143*210) is in neither sequence. Consider also A038698. - Antti Karttunen, Apr 25 2022

			2 is a term since A049345(2) = 10 has 1 trailing zero.
4 is a term since A049345(2) = 20 has 1 trailing zero.
30 is a term since A049345(2) = 1000 has 3 trailing zeros.
From _Gus Wiseman_, Apr 23 2021: (Start)
The sequence of terms together with their prime indices begins:
      2: {1}             46: {1,9}             90: {1,2,2,3}
      4: {1,1}           50: {1,3,3}           92: {1,1,9}
      8: {1,1,1}         52: {1,1,6}           94: {1,15}
     10: {1,3}           56: {1,1,1,4}         98: {1,4,4}
     14: {1,4}           58: {1,10}           100: {1,1,3,3}
     16: {1,1,1,1}       60: {1,1,2,3}        104: {1,1,1,6}
     20: {1,1,3}         62: {1,11}           106: {1,16}
     22: {1,5}           64: {1,1,1,1,1,1}    110: {1,3,5}
     26: {1,6}           68: {1,1,7}          112: {1,1,1,1,4}
     28: {1,1,4}         70: {1,3,4}          116: {1,1,10}
     30: {1,2,3}         74: {1,12}           118: {1,17}
     32: {1,1,1,1,1}     76: {1,1,8}          120: {1,1,1,2,3}
     34: {1,7}           80: {1,1,1,1,3}      122: {1,18}
     38: {1,8}           82: {1,13}           124: {1,1,11}
     40: {1,1,1,3}       86: {1,14}           128: {1,1,1,1,1,1,1}
     44: {1,1,5}         88: {1,1,1,5}        130: {1,3,6}
(End)

Amiram Eldar, Table of n, a(n) for n = 1..10000
George E. Andrews and David Newman, Partitions and the Minimal Excludant, Annals of Combinatorics, Volume 23, May 2019, Pages 249-254.
Brian Hopkins, James A. Sellers, and Dennis Stanton, Dyson's Crank and the Mex of Integer Partitions, arXiv:2009.10873 [math.CO], 2020.
Wikipedia, Mex (mathematics)
Index entries for sequences computed from indices in prime factorization
Index entries for sequences related to primorial base

Cf. A002110, A049345, A053669, A132120, A276084.
Complement of A342051.
A099800 is subsequence.
Analogous sequences: A001950 (Zeckendorf representation), A036554 (binary), A145204 (ternary), A217319 (base 4), A232745 (factorial base).
The version for reversed binary expansion is A079523.
Positions of even terms in A257993.
A000070 counts partitions with a selected part.
A056239 adds up prime indices, row sums of A112798.
A073491 lists numbers with gap-free prime indices.
A079067 counts gaps in prime indices.
A238709 counts partitions by sum and least difference.
A333214 lists positions of adjacent unequal prime gaps.
A339662 gives greatest gap in prime indices.
Cf. A000720, A001223, A005408, A026794, A029707, A038698, A047235, A079068, A121539, A286469, A286470, A325351, A353525 (characteristic function).
Differs from A353531 for the first time at n=77, where a(77) = 212, as this sequence misses A353531(77) = 210.

seq[max_] := Module[{bases = Prime@Range[max, 1, -1], nmax}, nmax = Times @@ bases - 1; Select[Range[nmax], OddQ @ LengthWhile[Reverse @ IntegerDigits[#, MixedRadix[bases]], #1 == 0 &] &]]; seq[4]
Select[Range[100],EvenQ[Min@@Complement[Range[PrimeNu[#]+1],PrimePi/@First/@FactorInteger[#]]]&] (* Gus Wiseman, Apr 23 2021 *)

A353525(n) = { for(i=1,oo,if(n%prime(i),return((i+1)%2))); }
isA342050(n) = A353525(n);
k=0; n=0; while(k<77, n++; if(isA342050(n), k++; print1(n,", "))); \\ Antti Karttunen, Apr 25 2022

More terms added (to differentiate from A353531) by Antti Karttunen, Apr 25 2022

A333216 Lengths of maximal subsequences without adjacent equal terms in the sequence of prime gaps.

Original entry on oeis.org

2, 13, 21, 3, 7, 8, 1, 18, 29, 5, 3, 8, 11, 31, 4, 20, 3, 7, 5, 19, 21, 32, 1, 19, 48, 19, 29, 32, 7, 38, 1, 43, 12, 33, 46, 6, 16, 8, 4, 34, 15, 1, 19, 7, 1, 23, 28, 30, 22, 8, 1, 7, 1, 52, 14, 56, 10, 26, 2, 30, 65, 5, 71, 12, 44, 39, 37, 6, 19, 47, 11, 10

Offset: 1

Gus Wiseman, Mar 15 2020

Prime gaps are differences between adjacent prime numbers.

Essentially the same as A145024. - R. J. Mathar, Mar 16 2020

			The prime gaps split into the following subsequences without adjacent equal terms: (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,2,4,14,4,6,2,10,2,6), (6,4,6), (6,2,10,2,4,2,12), (12,4,2,4,6,2,10,6), ...

First differences of A064113.
The version for the Kolakoski sequence is A306323.
The weakly decreasing version is A333212.
The weakly increasing version is A333215.
The strictly decreasing version is A333252.
The strictly increasing version is A333253.
The equal version is A333254.
Cf. A000040, A001223, A084758, A106356, A124762, A124767, A333214.

Length/@Split[Differences[Array[Prime,100]],UnsameQ]//Most

Ones correspond to balanced prime quartets (A054800), so the sum of terms up to but not including the n-th one is A000720(A054800(n - 1)) = A090832(n).

A376602 Inflection and undulation points in the sequence of composite numbers (A002808).

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 14, 15, 16, 18, 20, 21, 22, 25, 27, 29, 32, 33, 34, 37, 38, 39, 41, 43, 44, 45, 48, 50, 52, 53, 54, 57, 60, 61, 62, 65, 66, 67, 68, 69, 72, 74, 76, 78, 80, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 96, 99, 100, 101, 103, 105, 106, 107, 108

Offset: 1

Gus Wiseman, Oct 05 2024

nonn

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

			The composite numbers (A002808) are:
  4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, ...
with first differences (A073783):
  2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, ...
with first differences (A073445):
  0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, ...
with zeros at (A376602):
  1, 3, 5, 7, 9, 11, 14, 15, 16, 18, 20, 21, 22, 25, 27, 29, 32, 33, 34, 37, 38, ...

Wikipedia, Inflection point
Gus Wiseman, Inflection and undulation points in the sequence of composite numbers.

Partitions into composite numbers are counted by A023895, factorizations A050370.
For prime instead of composite we have A064113.
These are the positions of zeros in A073445.
For first differences we had A073783, ones A375929, complement A065890.
For concavity in primes we have A258025/A258026, weak A333230/A333231.
For upward concavity (instead of zero) we have A376651, downward A376652.
The complement is A376603.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376603 (nonzero curvature), A376651 (concave-up), A376652 (concave-down).
For inflection and undulation points: A064113 (prime), A376588 (non-perfect-power), A376591 (squarefree), A376594 (nonsquarefree), A376597 (prime-power), A376600 (non-prime-power).
Cf. A000040, A036263, A251092, A333214, A333216, A333254.

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

A333215 Lengths of maximal weakly increasing subsequences in the sequence of prime gaps (A001223).

Original entry on oeis.org

4, 2, 3, 2, 1, 4, 2, 1, 2, 3, 1, 2, 3, 2, 2, 3, 3, 2, 2, 3, 1, 3, 2, 3, 2, 1, 3, 1, 3, 2, 4, 2, 3, 3, 2, 2, 3, 1, 3, 1, 2, 3, 2, 2, 2, 3, 2, 3, 1, 2, 1, 4, 2, 4, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 3, 1, 3, 1, 3, 3, 1, 4, 4, 2, 2, 2, 3, 2, 3, 1, 5, 3, 2, 2, 4, 3, 3

Offset: 1

Gus Wiseman, Mar 14 2020

nonn

Prime gaps are differences between adjacent prime numbers.

			The prime gaps split into the following weakly increasing subsequences: (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), (2,4,14), ...

Prime gaps are A001223.
Ones correspond to strong prime quartets A054804.
Weakly increasing runs of compositions in standard order are A124766.
First differences of A258026 (with zero prepended).
The version for the Kolakoski sequence is A332875.
The weakly decreasing version is A333212.
The unequal version is A333216.
Positions of weak ascents in prime gaps are A333230.
The strictly decreasing version is A333252.
The strictly increasing version is A333253.
The equal version is A333254.
Cf. A000040, A000720, A036263, A054819, A064113, A084758, A124765, A124768, A258025, A333213, A333214.

Length/@Split[Differences[Array[Prime,100]],#1<=#2&]//Most

Ones correspond to strong prime quartets (A054804), so the sum of terms up to but not including the n-th one is A000720(A054804(n - 1)).

A376683 Antidiagonal-sums of the array A376682(n,k) = n-th term of the k-th differences of the noncomposite numbers (A008578).

Original entry on oeis.org

1, 3, 4, 9, 6, 27, -20, 109, -182, 471, -868, 1737, -2872, 4345, -4700, 1133, 14060, -55275, 150462, -346093, 717040, -1369351, 2432872, -4002905, 5964846, -7524917, 6123130, 4900199, -40900410, 134309057, -348584552, 798958881, -1678213106, 3277459119

Offset: 0

Gus Wiseman, Oct 15 2024

sign

			The fourth anti-diagonal of A376682 is: (7, 2, 0, -1, -2), so a(4) = 6.

The modern version (for A000040 instead of A008578) is A140119.
The absolute version is A376681.
Antidiagonal-sums of A376682 (modern version A095195).
For composite instead of noncomposite we have A377033.
For squarefree instead of noncomposite we have A377038, nonsquarefree A377046.
A000040 lists the modern primes, differences A001223, second A036263.
A008578 lists the noncomposites, first differences A075526.
Cf. A007442, A030016, A064113, A065890, A002808, A173390, A233671, A333214, A333254, A376678, A376684, A376855.

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

A333231 Positions of weak descents in the sequence of differences between primes.

Original entry on oeis.org

2, 4, 6, 9, 11, 12, 15, 16, 18, 19, 21, 24, 25, 27, 30, 32, 34, 36, 37, 39, 40, 42, 44, 46, 47, 48, 51, 53, 54, 55, 56, 58, 59, 62, 63, 66, 68, 72, 73, 74, 77, 80, 82, 84, 87, 88, 91, 92, 94, 97, 99, 101, 102, 103, 106, 107, 108, 110, 111, 112, 114, 115, 118

Offset: 1

Gus Wiseman, Mar 18 2020

Partial sums of A333253.

			The prime gaps split into the following strictly increasing subsequences: (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), (2,4,14), ...

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Thomas Bloom, Let d_n = p_(n+1)-p_n. The set of n such that d_(n+1) >= d_n has density 1/2, and similarly for d_(n+1) <= d_n. Furthermore, there are infinitely many n such that d_(n+1) = d_n, Erdős Problems.
Terence Tao, Erdős problem database, see no. 218.

The version for the Kolakoski sequence is A025505.
The version for equal differences is A064113.
The version for strict ascents is A258025.
The version for strict descents is A258026.
The version for distinct differences is A333214.
The version for weak ascents is A333230.
First differences are A333253 (if the first term is 0).
Prime gaps are A001223.
Weakly decreasing runs of compositions in standard order are A124765.
Strictly increasing runs of compositions in standard order are A124768.
Runs of prime gaps with nonzero differences are A333216.
Cf. A000040, A000720, A001221, A036263, A054819, A084758, A114994, A124760, A124761, A124766, A124769, A333212.

Accumulate[Length/@Split[Differences[Array[Prime,100]],#1<#2&]]//Most
- or -
Select[Range[100],Prime[#+1]-Prime[#]>=Prime[#+2]-Prime[#+1]&]

Numbers k such that prime(k+2) - 2*prime(k+1) + prime(k) >= 0.

A376603 Points of nonzero curvature in the sequence of composite numbers (A002808).

Original entry on oeis.org

2, 4, 6, 8, 10, 12, 13, 17, 19, 23, 24, 26, 28, 30, 31, 35, 36, 40, 42, 46, 47, 49, 51, 55, 56, 58, 59, 63, 64, 70, 71, 73, 75, 77, 79, 81, 82, 94, 95, 97, 98, 102, 104, 112, 114, 118, 119, 123, 124, 126, 127, 131, 132, 136, 138, 146, 148, 150, 152, 162, 163

Offset: 1

Gus Wiseman, Oct 05 2024

nonn

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

			The composite numbers (A002808) are:
  4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, ...
with first differences (A073783):
  2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, ...
with first differences (A073445):
  0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, ...
with nonzero terms at (A376603):
  2, 4, 6, 8, 10, 12, 13, 17, 19, 23, 24, 26, 28, 30, 31, 35, 36, 40, 42, 46, 47, ...

Dominic McCarty, Table of n, a(n) for n = 1..1000
Gus Wiseman, Points of nonzero curvature in the sequence of composite numbers.

Partitions into composite numbers are counted by A023895, factorizations A050370.
These are the positions of nonzero terms in A073445.
For first differences we had A073783, ones A375929, complement A065890.
For prime instead of composite we have A333214.
The complement is A376602.
For upward concavity (instead of nonzero) we have A376651, downward A376652.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376602 (zeros), A376651 (concave-up), A376652 (concave-down).
For nonzero curvature: A333214 (prime), A376589 (non-perfect-power), A376592 (squarefree), A376595 (nonsquarefree), A376598 (prime-power), A376601 (non-prime-power).
Cf. A000961, A064113, A246655, A251092, A258025, A333254.

Join@@Position[Sign[Differences[Select[Range[100],CompositeQ],2]],1|-1]

A376681 Row sums of the absolute value of the array A095195(n, k) = n-th term of the k-th differences of the prime numbers (A000040).

Original entry on oeis.org

2, 4, 8, 10, 22, 36, 72, 134, 266, 500, 874, 1418, 2044, 2736, 4626, 15176, 41460, 95286, 196368, 372808, 660134, 1092790, 1682198, 2384724, 3147706, 4526812, 11037090, 36046768, 93563398, 214796426, 452129242, 885186658, 1619323680, 2763448574, 4368014812

Offset: 1

Gus Wiseman, Oct 15 2024

nonn

			The fourth row of A095195 is: (7, 2, 0, -1), so a(4) = 10.

For firsts instead of row-sums we have A007442 (modern version of A030016).
This is the absolute version of A140119.
If 1 is considered prime (A008578) we get A376684, absolute version of A376683.
For first zero-positions we have A376678 (modern version of A376855).
For composite instead of prime we have A377035.
For squarefree instead of prime we have A377040, nonsquarefree A377048.
A000040 lists the modern primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, differences A075526, seconds A036263 with 0 prepended.
Cf. A064113, A065890, A084758, A173390, A233671, A258025, A333214, A333254, A376602, A376651, A376652, A377033.

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

More terms from Pontus von Brömssen, Oct 17 2024

A376598 Points of nonzero curvature in the sequence of prime-powers inclusive (A000961).

Original entry on oeis.org

4, 5, 7, 9, 10, 11, 12, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 80

Offset: 1

Gus Wiseman, Oct 05 2024

nonn

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

Inclusive means 1 is a prime-power. For the exclusive version, subtract 1 from all terms.

			The prime-powers inclusive (A000961) are:
  1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, ...
with first differences (A057820):
  1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, 6, 2, ...
with first differences (A376596):
  0, 0, 0, 1, -1, 0, 1, 0, 1, -2, 1, 2, -2, 0, 0, 0, -1, 4, -1, -2, 2, -2, 2, 2, ...
with nonzeros at (A376598):
  4, 5, 7, 9, 10, 11, 12, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, ...

Gus Wiseman, Points of nonzero curvature in the prime-powers inclusive.

The first differences were A057820, see also A376340.
First differences are A376309.
These are the nonzeros of A376596 (sorted firsts A376653, exclusive A376654).
The complement is A376597.
A000961 lists prime-powers inclusive, exclusive A246655.
A001597 lists perfect-powers, complement A007916.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
`A064113 lists positions of adjacent equal prime gaps.
For prime-powers inclusive: A057820 (first differences), A376597 (second differences), A376597 (inflections and undulations), A376653 (sorted firsts in second differences).
For points of nonzero curvature: A333214 (prime), A376603 (composite), A376589 (non-perfect-power), A376592 (squarefree), A376595 (nonsquarefree), A376601 (non-prime-power).
Cf. A025475, A053707, A069623, A093555, A174965, A251092, A333254, A336416, A361102.

Join@@Position[Sign[Differences[Select[Range[1000], #==1||PrimePowerQ[#]&],2]],1|-1]

A376678 Position of first zero in the n-th differences of the primes, or 0 if it does not appear.

Original entry on oeis.org

0, 0, 2, 7, 69, 13, 47, 58, 9, 43, 3553, 100, 7019, 14082, 68097, 14526, 149677, 2697, 481054, 979719, 631894, 29811, 25340978, 50574254, 7510843, 210829337, 67248861, 224076286, 910615647, 931510269, 452499644, 2880203722, 396680865, 57954439970, 77572822440, 35394938648

Offset: 0

Gus Wiseman, Oct 14 2024

nonn

Do the k-th differences of the primes contain a zero for all k > 1?

			The third differences of the primes begin:
  -1, 2, -4, 4, -4, 4, 0, -6, 8, ...
so a(3) = 7.

Lucas A. Brown, Python program.

If 1 is considered prime (A008578) we get A376855.
The zeros of second differences are A064113, complement A333214.
This is the position at which 0 first appears in row n of A095195.
For composite instead of prime we have A377037.
For squarefree instead of prime we have A377042, nonsquarefree A377050.
For prime-power instead of prime we have A377055.
A000040 lists the primes, first differences A001223, second A036263.
Cf. A000720, A007442, A030016, A065890, A084758, A140119, A258025, A258026, A333254, A349643, A376681, A376682, A376683.

nn=100000;
u=Table[Differences[Select[Range[nn],PrimeQ],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(n) = A000720(A349643(n)) for n >= 2. - Pontus von Brömssen, Oct 17 2024

a(17)-a(32) from Pontus von Brömssen, Oct 17 2024

a(33)-a(35) from Lucas A. Brown, Nov 03 2024

cp's OEIS Frontend

A342050 Numbers k which have an odd number of trailing zeros in their primorial base representation A049345(k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A333216 Lengths of maximal subsequences without adjacent equal terms in the sequence of prime gaps.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376602 Inflection and undulation points in the sequence of composite numbers (A002808).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A333215 Lengths of maximal weakly increasing subsequences in the sequence of prime gaps (A001223).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376683 Antidiagonal-sums of the array A376682(n,k) = n-th term of the k-th differences of the noncomposite numbers (A008578).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A333231 Positions of weak descents in the sequence of differences between primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A376603 Points of nonzero curvature in the sequence of composite numbers (A002808).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376681 Row sums of the absolute value of the array A095195(n, k) = n-th term of the k-th differences of the prime numbers (A000040).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica