A205403 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A205403

a(n) is the index j < k such that n divides s(k)-s(j) for some j, where s(j) = floor((j+1)^2/2)/2, and k is the least index for which such a j exists.

1, 2, 1, 2, 1, 4, 2, 1, 2, 2, 1, 3, 6, 2, 1, 3, 2, 2, 1, 7, 3, 8, 2, 1, 4, 3, 5, 2, 1, 4, 9, 3, 5, 2, 1, 4, 6, 3, 9, 2, 1, 10, 4, 6, 3, 15, 2, 1, 2, 4, 10, 3, 3, 2, 1, 7, 15, 4, 20, 3, 8, 2, 1, 11, 7, 4, 5, 3, 6, 2, 1, 5, 11, 7, 4, 14, 3, 6, 2, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

For a guide to related sequences, see A204892.

LINKS

Table of n, a(n) for n=1..80.

MATHEMATICA

(See the program at A205402.)

CROSSREFS

Cf. A205402, A204892.

Sequence in context: A321368 A338508 A100380 * A080825 A229724 A034693