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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205030 The number s(j)=j*(j+1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists. 2
2, 2, 6, 2, 2, 6, 6, 12, 2, 2, 20, 6, 30, 6, 12, 56, 56, 2, 72, 2, 30, 20, 110, 6, 6, 30, 2, 2, 182, 12, 210, 240, 6, 56, 2, 6, 306, 72, 12, 2, 380, 30, 420, 12, 20, 110, 506, 42, 12, 6, 30, 20, 650, 2, 72, 20, 42, 182, 812, 12 (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: A046110 A296091 A126889 * A278250 A134339 A162299

Adjacent sequences:  A205027 A205028 A205029 * A205031 A205032 A205033

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 20 19:52 EDT 2019. Contains 321349 sequences. (Running on oeis4.)