A381466 -id:A381466 - cp's OEIS frontend

A381495 a(n) is the number of times n appears in A381466.

0, 2, 2, 1, 3, 1, 5, 2, 3, 2, 2, 0, 2, 0, 2, 1, 0, 1, 4, 2, 3, 2, 3, 1, 6, 0, 1, 0, 4, 0, 5, 2, 0, 1, 0, 1, 6, 0, 4, 1, 3, 2, 3, 1, 1, 0, 2, 1, 0, 0, 2, 2, 4, 1, 3, 0, 4, 1, 4, 1, 4, 1, 1, 3, 1, 4, 2, 0, 1, 1, 2, 1, 3, 0, 2, 3, 3, 1, 2, 3, 1, 1, 2, 1, 0, 0, 2, 1, 1, 2, 4, 0, 0, 2, 1, 0, 3, 0, 2, 1, 2, 1, 2, 0, 0, 0, 3, 2, 3, 0, 3, 1, 3, 1, 1, 2, 4, 1, 3, 1, 3, 0, 1, 0, 2, 1, 4, 1, 1, 1

Offset: 1

Sam Chapman, Feb 25 2025

nonn

The sequence is well defined, as we have proven that A381466(n) > sqrt(n/6) for all n, and thus each number can only appear a finite amount of times in A381466.

It appears that this sequence has an average value of approximately 1.755

Sam Chapman, Table of n, a(n) for n = 1..2000

Cf. A381466, A381501 (indices of 0's).

A381501 Positive integers that do not appear in A381466.

Original entry on oeis.org

1, 12, 14, 17, 26, 28, 30, 33, 35, 38, 46, 49, 50, 56, 68, 74, 85, 86, 92, 93, 96, 98, 104, 105, 106, 110, 122, 124, 132, 134, 140, 156, 164, 166, 170, 182, 188, 190, 194, 195, 200, 202, 214, 218, 226, 236, 242, 248, 250, 254, 260, 284, 285, 290, 302, 304, 305, 308, 310, 314, 320, 326, 336, 338, 344, 346, 350, 362, 368, 374, 375

Offset: 1

Sam Chapman, Feb 25 2025

nonn

The sequence appears to grow linearly and is approximately 5.42*n.

A381495(k) = 0 if and only if k appears in this sequence.

Sam Chapman, Table of n, a(n) for n = 1..366

Cf. A381466, A381495.

cp's OEIS Frontend

A381495 a(n) is the number of times n appears in A381466.

Views

Author

Keywords

Comments

Links

Crossrefs