A205133 - OEIS

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

A205133

The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2*j-1) and k is the least positive integer for which such a j exists.

1, 1, 6, 1, 1, 15, 1, 1, 6, 15, 6, 6, 15, 1, 15, 1, 28, 1, 28, 6, 45, 6, 45, 15, 66, 153, 1, 91, 91, 15, 91, 1, 120, 276, 15, 45, 153, 28, 6, 45, 190, 66, 190, 1, 1, 45, 231, 6, 6, 28, 15, 120, 325, 66, 66, 45, 6, 861, 378, 6

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

OFFSET

1,3

COMMENTS

For a guide to related sequences, see A204892.

LINKS

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

MATHEMATICA

(See the program at A205130.)

CROSSREFS

Cf. A205130, A204892.

Sequence in context: A230073 A143210 A347672 * A152238 A295985 A086645

Adjacent sequences: A205130 A205131 A205132 * A205134 A205135 A205136

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 25 2012

STATUS

approved