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!)
A110351 Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2. 3
2, 3, 30, 110, 30, 84, 1148, 1980, 585, 935, 462, 702, 2912, 105, 3120, 32504, 9027, 11457, 2660, 420, 2772, 26312, 16560, 19800, 44525, 52299, 17388, 20300, 10005, 11625, 460784, 61248, 11220, 2975, 24570, 43290, 220742, 29640, 4680, 188600 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3) = 4 + 5 + 6 + 7 + 8 = 30 = 5*6, T(3) = 3*4/2 = 6.
MAPLE
a:=proc(n) local p, m: p:=proc(k) if type(sum(n+j, j=1..k)/(n*(n+1)/2), integer)=true then k else fi end: m:=[seq(p(k), k=1..1200)][1]: sum(n+j, j=1..m) end: seq(a(n), n=1..45); # Emeric Deutsch, Aug 08 2005
MATHEMATICA
Do[t = n*(n+1)/2; k = 1; While[Mod[k*n + k*(k+1)/2, t] > 0, k++ ]; Print[k*n + k*(k+1)/2], {n, 1, 50}] (* Ryan Propper, Aug 08 2005 *)
CROSSREFS
Sequence in context: A325506 A203431 A137981 * A326224 A270483 A217370
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 21 2005
EXTENSIONS
More terms from Emeric Deutsch and Ryan Propper, Aug 08 2005
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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)