A156242 -id:A156242 - cp's OEIS frontend

A216348 Numbers that appear in either both A156242(n) + 1 and A156243(n) or both A156242(n) and A156243(n) + 1.

6, 7, 10, 15, 20, 21, 24, 25, 30, 33, 34, 37, 42, 43, 46, 47, 50, 55, 60, 61, 64, 69, 72, 73, 76, 77, 82, 87, 88, 91, 96, 101, 102, 105, 106, 109, 114, 117, 118, 123, 128, 129, 132, 137, 142, 143, 146, 147

Offset: 1

Jon Perry, Sep 04 2012

nonn

			6 is in both A156242 and A156243 + 1.
7 is in both A156242 + 1 and A156243.

Cf. A156242, A156243, A054353.

n = 10; t = Prepend[Nest[Flatten[Partition[#, 2] /. {{2, 2} -> {2, 2, 1, 1}, {2, 1} -> {2, 2, 1}, {1, 2} -> {2, 1, 1}, {1, 1} -> {2, 1}}] &, {2, 2}, n], 1]; t2 = Accumulate[t]; {t3, t4} = Transpose[Partition[t2, 2]]; Union[Intersection[t3, t4 + 1], Intersection[t3 + 1, t4]] (* T. D. Noe, Sep 26 2012 *)

A258026 Numbers k such that prime(k+2) - 2*prime(k+1) + prime(k) < 0.

Original entry on oeis.org

4, 6, 9, 11, 12, 16, 18, 19, 21, 24, 25, 27, 30, 32, 34, 37, 40, 42, 44, 47, 48, 51, 53, 56, 58, 59, 62, 63, 66, 68, 72, 74, 77, 80, 82, 84, 87, 88, 91, 92, 94, 97, 99, 101, 103, 106, 108, 111, 112, 114, 115, 119, 121, 125, 127, 128, 130, 132, 133, 135, 137

Offset: 1

Clark Kimberling, Jun 05 2015

Positions of strict descents in the sequence of differences between primes. Partial sums of A333215. - Gus Wiseman, Mar 24 2020

			The prime gaps split into the following maximal 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), ... Then a(n) is the n-th partial sum of the lengths of these subsequences. - _Gus Wiseman_, Mar 24 2020

Clark Kimberling, Table of n, a(n) for n = 1..1000
Wikipedia, Longest increasing subsequence

Partition of the positive integers:  A064113, A258025, A258026;
Corresponding partition of the primes: A063535, A063535, A147812.
Adjacent terms differing by 1 correspond to strong prime quartets A054804.
The version for the Kolakoski sequence is A156242.
First differences are A333215 (if the first term is 0).
The version for strict ascents is A258025.
The version for weak ascents is A333230.
The version for weak descents is A333231.
Prime gaps are A001223.
Positions of adjacent equal prime gaps are A064113.
Weakly increasing runs of compositions in standard order are A124766.
Strictly decreasing runs of compositions in standard order are A124769.
Cf. A000040, A000720, A001221, A036263, A054819, A084758, A124765, A124768, A333212, A333213, A333214, A333256.

u = Table[Sign[Prime[n+2] - 2 Prime[n+1] + Prime[n]], {n, 1, 200}];
Flatten[Position[u, 0]]   (* A064113 *)
Flatten[Position[u, 1]]   (* A258025 *)
Flatten[Position[u, -1]]  (* A258026 *)
Accumulate[Length/@Split[Differences[Array[Prime,100]],LessEqual]]//Most (* Gus Wiseman, Mar 24 2020 *)

from itertools import count, islice
from sympy import prime, nextprime
def A258026_gen(startvalue=1): # generator of terms >= startvalue
    c = max(startvalue,1)
    p = prime(c)
    q = nextprime(p)
    r = nextprime(q)
    for k in count(c):
        if p+r<(q<<1):
            yield k
        p, q, r = q, r, nextprime(r)
A258026_list = list(islice(A258026_gen(),20)) # Chai Wah Wu, Feb 27 2024

A054354 First differences of Kolakoski sequence A000002.

Original entry on oeis.org

1, 0, -1, 0, 1, -1, 1, 0, -1, 1, 0, -1, 0, 1, -1, 0, 1, 0, -1, 1, -1, 0, 1, -1, 1, 0, -1, 0, 1, -1, 0, 1, -1, 1, 0, -1, 1, 0, -1, 0, 1, -1, 1, 0, -1, 1, -1, 0, 1, -1, 0, 1, 0, -1, 1, 0, -1, 0, 1, -1, 1, 0, -1, 1, 0, -1, 0, 1, -1, 0, 1, -1, 1, 0, -1, 1, -1, 0, 1, 0, -1, 1, 0, -1, 0, 1, -1, 1, 0, -1, 1, 0, -1

Offset: 1

N. J. A. Sloane, May 07 2000

sign

The Kolakoski sequence has only 1's and 2's, and is cubefree. Thus, for all n>=1, a(n) is in {-1, 0, 1}, a(n+1) != a(n), and if a(n) = 0, a(n+1) = -a(n-1), while if a(n) != 0, either a(n+1) = 0 and a(n+2) = -a(n) or a(n+1) = -a(n). A further consequence is that the maximum gap between equal values is 4: for all n, there is an integer k, 1Jean-Christophe Hervé, Oct 05 2014
From Daniel Forgues, Jul 07 2015: (Start)
Second differences: {-1, -1, 1, 1, -2, 2, -1, -1, 2, -1, -1, 1, 1, ...}
The sequence of first differences bounces between -1 and 1 with a slope whose absolute value is either 1 or 2. We can compress the information in the second differences into {-1, 1, -2, 2, -1, 2, -1, 1, ...} since the -1 and the 1 come in pairs; which can be compressed further into {1, 1, 2, 2, 1, 2, 1, 1, ...} since the signs alternate, where we only need to know that the initial sign is negative. (End)
This appears to divide the positive integers into three sets, each with density approaching 1/3. Note there are no adjacent equal parts (as mentioned above). - Gus Wiseman, Oct 10 2024

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A000002, A054353.
Positions of 0 are A078649.
For Golomb's sequence (A001462) we have A088517.
Positions of -1 are A156242 (descents).
Positions of 1 are A156243 (ascents).
First differences (or second differences of A000002) are A376604.
The Kolakoski sequence (A000002):
- Restrictions: A074264, A100428, A100429, A156263, A156264, A288605.
- Patterns: A013947, A013948, A022292, A074262, A074263.
- Statistics: A074286, A088568, A156077, A156253.
- Transformations: A054354, A156728, A306323, A332273, A332875, A333229.
Cf. A333254.

a054354 n = a054354_list !! (n-1)
a054354_list = zipWith (-) (tail a000002_list) a000002_list
-- Reinhard Zumkeller, Aug 03 2013

a2 = {1, 2, 2}; Do[ a2 = Join[a2, {1 + Mod[n - 1, 2]}], {n, 3, 70}, {a2[[n]]}]; Differences[a2] (* Jean-François Alcover, Jun 18 2013 *)

Abs(a(n)) = (A000002(n)+A000002(n+1)) mod 2. - Benoit Cloitre, Nov 17 2003

A376604 Second differences of the Kolakoski sequence (A000002). First differences of A054354.

Original entry on oeis.org

-1, -1, 1, 1, -2, 2, -1, -1, 2, -1, -1, 1, 1, -2, 1, 1, -1, -1, 2, -2, 1, 1, -2, 2, -1, -1, 1, 1, -2, 1, 1, -2, 2, -1, -1, 2, -1, -1, 1, 1, -2, 2, -1, -1, 2, -2, 1, 1, -2, 1, 1, -1, -1, 2, -1, -1, 1, 1, -2, 2, -1, -1, 2, -1, -1, 1, 1, -2, 1, 1, -2, 2, -1, -1

Offset: 1

Gus Wiseman, Oct 02 2024

sign

Since A000002 has no runs of length 3, this sequence contains no zeros.

The densities appear to approach (1/3, 1/3, 1/6, 1/6).

			The Kolakoski sequence (A000002) is:
  1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, ...
with first differences (A054354):
  1, 0, -1, 0, 1, -1, 1, 0, -1, 1, 0, -1, 0, 1, -1, 0, 1, 0, -1, 1, -1, 0, 1, -1, ...
with first differences (A376604):
  -1, -1, 1, 1, -2, 2, -1, -1, 2, -1, -1, 1, 1, -2, 1, 1, -1, -1, 2, -2, 1, 1, -2, ...

A001462 is Golomb's sequence.
A078649 appears to be zeros of the first and third differences.
A288605 gives positions of first appearances of each balance.
A306323 gives a 'broken' version.
A333254 lists run-lengths of differences between consecutive primes.
For the Kolakoski sequence (A000002):
- Restrictions: A074264, A100428, A100429, A156263, A156264.
- Patterns: A013947, A013948, A022292, A074262, A074263, A156242, A156243.
- Statistics: A054353, A074286, A088568, A156077, A156253.
- Transformations: A054354, A156728, A332273, A332875, A333229, A376604.
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power), A376599 (non-prime-power).

kolagrow[q_]:=If[Length[q]<2,Take[{1,2},Length[q]+1],Append[q,Switch[{q[[Length[Split[q]]]],q[[-2]],Last[q]},{1,1,2},1,{1,2,1},2,{2,1,1},2,{2,1,2},2,{2,2,1},1,{2,2,2},1]]]
kol[n_]:=Nest[kolagrow,{1},n-1];
Differences[kol[100],2]

A376651 Points of upward concavity in the sequence of composite numbers (A002808).

Original entry on oeis.org

4, 8, 12, 17, 23, 26, 30, 35, 40, 46, 49, 55, 58, 63, 70, 73, 77, 81, 94, 97, 102, 112, 118, 123, 126, 131, 136, 146, 150, 162, 173, 176, 180, 185, 195, 200, 205, 210, 216, 219, 229, 242, 245, 249, 262, 267, 276, 280, 285, 292, 297, 302, 305, 310, 317, 320

Offset: 1

Gus Wiseman, Oct 06 2024

nonn

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

Also positions of strict ascents in the first differences (A073783) of composite numbers (A002808).

			The composite numbers are (A002808):
  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 positive terms at (A376651):
  4, 8, 12, 17, 23, 26, 30, 35, 40, 46, 49, 55, 58, 63, 70, 73, 77, 81, 94, 97, ...

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

The version for A000002 is A022297, negative A156242.
Partitions into composite numbers are counted by A023895, factorizations A050370.
For first differences we had A065310 or A073783, ones A375929.
These are the positions of positive terms in A073445, negative A376652.
For prime instead of composite we have A258025, negative A258026.
For zero second differences (instead of positive) we have A376602.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376602 (inflections and undulations), A376603 (nonzero curvature), A376652 (concave-down).
Cf. A000961, A057820, A064113, A065890, A251092, A333254, A376604.

Join@@Position[Sign[Differences[Select[Range[1000],CompositeQ],2]],1]

A376652 Points of downward concavity in the sequence of composite numbers (A002808).

Original entry on oeis.org

2, 6, 10, 13, 19, 24, 28, 31, 36, 42, 47, 51, 56, 59, 64, 71, 75, 79, 82, 95, 98, 104, 114, 119, 124, 127, 132, 138, 148, 152, 163, 174, 178, 181, 187, 196, 201, 206, 212, 217, 221, 230, 243, 247, 250, 263, 268, 278, 281, 286, 293, 298, 303, 306, 311, 318, 321

Offset: 1

Gus Wiseman, Oct 06 2024

nonn

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

Also positions of strict descents in the first differences (A073783) of composite numbers (A002808).

			The composite numbers are (A002808):
  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 second 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 negative terms at (A376651):
  2, 6, 10, 13, 19, 24, 28, 31, 36, 42, 47, 51, 56, 59, 64, 71, 75, 79, 82, 95, 98, ...

Robert Israel, Table of n, a(n) for n = 1..10000
Gus Wiseman, Points of downward concavity in the sequence of composite numbers.

The version for A000002 is A156242, positive A022297.
Partitions into composite numbers are counted by A023895, factorizations A050370.
For first differences we had A065310 or A073783, ones A375929.
These are the positions of negative terms in A073445, positive A376651.
For prime instead of composite we have A258026, positive A258025.
For zero second differences instead of negative we have A376602.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376602 (inflections and undulations), A376603 (nonzero curvature), A376651 (concave-up).
Cf. A000961, A007916, A057820, A064113, A065890, A251092, A333254, A376604.

Comps:= remove(isprime, [seq(i,i=4..1000)]):
D1:= Comps[2..-1]-Comps[1..-2]:
D2:= D1[2..-1]-D1[1..-2]:
select(t -> D2[t] < 0, [$1..nops(D2)]); # Robert Israel, Nov 06 2024

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

cp's OEIS Frontend

A216348 Numbers that appear in either both A156242(n) + 1 and A156243(n) or both A156242(n) and A156243(n) + 1.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A258026 Numbers k such that prime(k+2) - 2*prime(k+1) + prime(k) < 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A054354 First differences of Kolakoski sequence A000002.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A376604 Second differences of the Kolakoski sequence (A000002). First differences of A054354.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376651 Points of upward concavity in the sequence of composite numbers (A002808).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376652 Points of downward concavity in the sequence of composite numbers (A002808).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica