A379297 -id:A379297 - cp's OEIS frontend

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

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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 1, 0, 5, 4, 4, 5, 6, 7, 8, 7, 9, 10, 11, 12, 12, 13, 16, 16, 16, 16, 14, 12

Offset: 0

Pontus von Brömssen, Dec 19 2024

nonn

a(n) appears to grow roughly like sqrt(n).

Pontus von Brömssen, Table of n, a(n) for n = 0..9999
Pontus von Brömssen, Plot of A379265(n), A379266(n), and sqrt(n) for n=0..100000.

Cf. A272727, A379265, A379297.

def A379266_list(nterms):
    A = []
    A379265 = []
    for n in range(nterms):
        a = sum(1 for x, y in zip(A, reversed(A379265)) if x==y)
        if n != 0:
            b += (b==A[-1])
        else:
            b = 0
        A.append(a)
        A379265.append(b)
    return A

A379265 a(n) is the number of coincidences of the first n terms of this sequence and A379266, i.e., the number of equalities a(k) = A379266(k) for 0 <= k < n.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 10, 11, 12, 13, 13, 14, 14, 14, 14, 14, 15

Offset: 0

Pontus von Brömssen, Dec 19 2024

nonn

a(n) appears to grow roughly like sqrt(n).

Pontus von Brömssen, Table of n, a(n) for n = 0..9999
Pontus von Brömssen, Plot of A379265(n), A379266(n), and sqrt(n) for n=0..100000.

Cf. A272727, A379266, A379297.

def A379265_list(nterms):
    A = []
    A379266 = []
    for n in range(nterms):
        if n != 0:
            a += (a==A379266[-1])
        else:
            a = 0
        b = sum(1 for x,y in zip(A,reversed(A379266)) if x==y)
        A.append(a)
        A379266.append(b)
    return A

For n >= 1, a(n) = a(n-1)+1 if a(n-1) = A379266(n-1), otherwise a(n) = a(n-1).

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

Pontus von Brömssen, Jan 15 2025

nonn

Pontus von Brömssen, Table of n, a(n) for n = 1..134

Cf. A379297, A380188, A380189.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Python

A379265 a(n) is the number of coincidences of the first n terms of this sequence and A379266, i.e., the number of equalities a(k) = A379266(k) for 0 <= k < n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Python

Formula

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

Views

Author

Keywords

Links

Crossrefs