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

A205380

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

9, 9, 25, 9, 49, 25, 81, 9, 81, 49, 169, 25, 225, 81, 121, 25, 361, 81, 441, 49, 169, 169, 625, 25, 225, 225, 225, 81, 961, 121, 1089, 81, 289, 361, 289, 81, 1521, 441, 361, 49, 1849, 169, 2025, 169, 361, 625, 2401, 49, 441, 225, 529, 225, 3025, 225

(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..54.

MATHEMATICA

(See the program at A205378.)

CROSSREFS

Cf. A205378, A204892.

Sequence in context: A144424 A359038 A282269 * A246035 A358128 A147340

Adjacent sequences: A205377 A205378 A205379 * A205381 A205382 A205383

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 26 2012

STATUS

approved