The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066561 a(n) is the smallest triangular number divisible by n. 3
 1, 6, 3, 28, 10, 6, 21, 120, 36, 10, 55, 36, 78, 28, 15, 496, 136, 36, 171, 120, 21, 66, 253, 120, 300, 78, 351, 28, 406, 120, 465, 2016, 66, 136, 105, 36, 666, 190, 78, 120, 820, 210, 903, 528, 45, 276, 1081, 528, 1176, 300, 153, 780, 1378, 378, 55, 1176, 171 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 PROG (PARI) { for (n=1, 1000, s=0; b=0; while (b==0, s++; t=s*(s+1)/2; if (t%n == 0, b=1)); write("b066561.txt", n, " ", t) ) } \\ Harry J. Smith, Mar 05 2010 CROSSREFS Cf. A000217. Sequence in context: A285607 A287546 A285559 * A073872 A281677 A282303 Adjacent sequences:  A066558 A066559 A066560 * A066562 A066563 A066564 KEYWORD nonn AUTHOR Amarnath Murthy, Dec 17 2001 EXTENSIONS More terms from Naohiro Nomoto, Dec 26 2001 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.

Last modified January 19 21:47 EST 2020. Contains 331066 sequences. (Running on oeis4.)