login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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: A231901 A135974 A153494 * A322372 A316945 A307370

Adjacent sequences:  A205401 A205402 A205403 * A205405 A205406 A205407

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 27 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 10:13 EDT 2019. Contains 324234 sequences. (Running on oeis4.)