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

A205398

s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=ceiling(j^2/2).

1, 4, 3, 4, 5, 6, 7, 8, 27, 10, 11, 12, 13, 14, 30, 16, 17, 36, 19, 20, 42, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 70, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 100, 102, 52, 53, 54, 110, 56, 57, 58, 59, 60, 61, 62, 63, 64, 130, 66, 67

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

MATHEMATICA

(See the program at A205394.)

CROSSREFS

Cf. A205394, A204892.

Sequence in context: A090369 A260031 A132293 * A135103 A369052 A282822

Adjacent sequences: A205395 A205396 A205397 * A205399 A205400 A205401

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 27 2012

STATUS

approved