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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205029 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=j*(j+1). 2
6, 6, 12, 6, 12, 12, 20, 20, 20, 12, 42, 30, 56, 20, 42, 72, 90, 20, 110, 42, 72, 42, 156, 30, 56, 56, 56, 30, 240, 42, 272, 272, 72, 90, 72, 42, 380, 110, 90, 42, 462, 72, 506, 56, 110, 156, 600, 90, 110, 56, 132, 72, 756, 56, 182, 132, 156, 240, 930, 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..60.

MATHEMATICA

(See the program at A205018.)

CROSSREFS

Cf. A205018, A204892.

Sequence in context: A173319 A040031 A205695 * A255488 A247513 A124508

Adjacent sequences:  A205026 A205027 A205028 * A205030 A205031 A205032

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 22 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 13:59 EDT 2022. Contains 354092 sequences. (Running on oeis4.)