A381609 a(n) is the number of occurrences of n in A381607.

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1

Offset

0,9

Comments

All terms are positive (see A381579).

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Rémy Sigrist, PARI program

Formula

a(n) > 0.

Example

The number 8 appears twice in A381607, so a(8) = 2.

Prog

(PARI) \\ See Links section.

Crossrefs

Cf. A381579, A381607.

Sequence in context: A006466 A316439 A335078 * A086597 A322320 A369008

Adjacent sequences: A381606 A381607 A381608 * A381610 A381611 A381612

Keyword

nonn,base

Author

Rémy Sigrist, Mar 01 2025

Status

approved