A380939 a(n) is the number of positive integers v that belong alongside their opposites -v to the minimal set of integers to add to the set {A377091(k), k = 0..A380938(n)} in order to obtain an integer interval.

1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset

1,5

Links

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

Rémy Sigrist, C++ program

Example

For n = 5: A380938(5) = 840, {A377091(k), k = 0..840} = {-422, -419..419, 422}, to obtain an integer interval, we can add the minimal set {-421, -420, 420, 421}; there are two positive integers that appear alongside their opposites in this minimal set; so a(5) = 2.

Prog

(C++) // See Links section.

Crossrefs

Cf. A377091, A380501, A380938.

Sequence in context: A272901 A078315 A365685 * A346418 A288120 A156264

Adjacent sequences: A380932 A380933 A380938 * A380940 A380941 A380942

Keyword

nonn,new

Author

Rémy Sigrist, Feb 08 2025

Status

approved