A205404 - 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

A205404

Least s(k) such that n divides s(k)-s(j) for some j < k, where s(j) = floor((j+1)^2/2)/2.

2, 4, 4, 6, 6, 12, 9, 9, 20, 12, 12, 16, 25, 16, 16, 20, 36, 20, 20, 36, 25, 42, 25, 25, 56, 30, 36, 30, 30, 36, 56, 36, 42, 36, 36, 42, 49, 42, 64, 42, 42, 72, 49, 56, 49, 110, 49, 49, 100, 56, 81, 56, 110, 56, 56, 72, 121, 64, 169, 64, 81, 64, 64, 100, 81, 72

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

OFFSET

1,1

COMMENTS

For a guide to related sequences, see A204892.

LINKS

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

MATHEMATICA

(See the program at A205402.)

CROSSREFS

Cf. A205402, A204892.

Sequence in context: A135974 A153494 A352749 * A322372 A330812 A368200