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

%I #5 Mar 30 2012 18:58:10

%S 6,6,12,6,12,12,20,20,20,12,42,30,56,20,42,72,90,20,110,42,72,42,156,

%T 30,56,56,56,30,240,42,272,272,72,90,72,42,380,110,90,42,462,72,506,

%U 56,110,156,600,90,110,56,132,72,756,56,182,132,156,240,930,72

%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=j*(j+1).

%C For a guide to related sequences, see A204892.

%t (See the program at A205018.)

%Y Cf. A205018, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 22 2012

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 April 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)