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

A248805 The difference A156257(n)-A074292(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Jean-Christophe Hervé, Oct 11 2014

Keywords

Comments

Related to the position and frequency of runs of length 2 in the Kolakoski sequence A000002.
Possible values are -1, 0, 1, and a 1 seems to be always followed soon by a -1, indicating that the two sequences A074292 and A156257 are not equal but rather close (this might help to show the equality of the proportions of 1 and 2 in the Kolakoski sequence).

Crossrefs

Programs

A249372 Numbers k such that A156257(k) != A074292(k).

Original entry on oeis.org

47, 48, 56, 57, 128, 129, 137, 139, 147, 148, 176, 177, 182, 183, 185, 187, 188, 190, 192, 194, 195, 196, 197, 199, 201, 202, 203, 205, 207, 209, 210, 211, 212, 214, 218, 220, 222, 223, 227, 229, 230, 232, 233, 235, 237, 238, 239, 240, 242, 244
Offset: 1

Views

Author

Jean-Christophe Hervé, Nov 22 2014

Keywords

Comments

Related to the position and frequency of runs of length 2 in the Kolakoski sequence A000002. Possible values of the difference A156257 - A074292 are -1, 0, 1, and a 1 seems to be always followed soon by a -1, indicating that the two sequences A074292 and A156257 are not equal but rather close.

Crossrefs

Cf. A000002, A074292, A156257, A247176 (values of the difference).

A074292 Dominant digit in successive groups of 3 from the Kolakoski sequence (A000002).

Original entry on oeis.org

2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1
Offset: 1

Views

Author

Jon Perry, Sep 21 2002

Keywords

Comments

This appears to be the same as a sequence studied by Claude Lenormand in a letter dated Nov 17 2003: break up the Kolakoski sequence (A000002) into runs of identical symbols and omit one symbol from each run.
The sequence studied by Claude Lenormand is A156257 and is not equal to this one: see A248805 = A156257 - A074292. Differences between the two sequences are at n = 47, 48, 56, 57, 128, 129, 137, 139, 147, 148, 176, 177,... - Jean-Christophe Hervé, Oct 11 2014
As in the Kolakoski sequence, runs in this sequence are of length 1 or 2, because a run XX implies the repetition of exactly the same 3-group in the Kolakoski sequence: -YXX-YXX- or -XXY-XXY- or -XYX-XYX-, and this is not possible 3 times. However, words of the form YXYXY appear in this sequence, but don't appear in the Kolakoski sequence. - Jean-Christophe Hervé, Oct 12 2014

Examples

			Kolakoski begins (1,2,2), (1,1,2), (1,2,2), (1,2,2), so this begins 2,1,2,2.
		

Crossrefs

Programs

Formula

a(n)=A000002(3n-2)+A000002(3n-1)+A000002(3n)-3. - Benoit Cloitre, Nov 15 2003

Extensions

More terms from Ray Chandler, Nov 16 2003
Offset corrected by Jean-Christophe Hervé, Oct 11 2014
Showing 1-3 of 3 results.