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

A380189 a(n) is the number of coincidences of the first n terms of this sequence and the first n terms of A380188 in reverse order, i.e., the number of equalities a(k) = A380188(n-1-k) for 0 <= k < n.

Original entry on oeis.org

0, 1, 0, 2, 0, 1, 1, 2, 1, 0, 3, 1, 0, 2, 0, 2, 2, 2, 2, 3, 3, 3, 1, 0, 3, 2, 3, 3, 4, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 3, 6, 6, 6, 6, 8, 7, 6, 5, 5, 5, 4, 4, 2, 1, 0, 3, 1, 0, 2, 0, 2, 2, 3, 5, 7, 7, 6, 5, 4, 5, 5, 6, 3, 2, 2, 1, 1, 4, 3, 1, 2, 3, 2, 4, 3, 4, 4
Offset: 0

Views

Author

Pontus von Brömssen, Jan 15 2025

Keywords

Examples

			For n = 7, the first 7 terms of this sequence and the first 7 terms of A380188 in reverse order are:
  0, 1, 0, 2, 0, 1, 1
  3, 3, 3, 2, 2, 1, 0
           ^     ^
with 2 coincidences, so a(7) = 2.
		

Crossrefs

A380190 Indices k where A380188 changes, i.e., such that A380188(k) != A380188(k-1).

Original entry on oeis.org

1, 2, 4, 11, 21, 22, 25, 29, 31, 32, 33, 45, 225, 226, 227, 256, 355, 2737, 2738, 2740, 2741, 2775, 2779, 2780, 2781, 2790, 2796, 2798, 2802, 2811, 2814, 2817, 2819, 2820, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2907, 2908, 2909, 2910, 2911, 2912, 2913, 2914
Offset: 1

Views

Author

Pontus von Brömssen, Jan 15 2025

Keywords

Crossrefs

Showing 1-2 of 2 results.