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,2

Comments

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

Links

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

Crossrefs

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

Sequence in context: A379735 A057036 A069004 * A182490 A053274 A243926

Adjacent sequences: A381492 A381493 A381494 * A381496 A381497 A381498

Keyword

nonn,new

Author

Sam Chapman, Feb 25 2025

Status

approved