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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A345988 Smallest oblong number m*(m+1) that is divisible by n. 3
2, 2, 6, 12, 20, 6, 42, 56, 72, 20, 110, 12, 156, 42, 30, 240, 272, 72, 342, 20, 42, 110, 506, 72, 600, 156, 702, 56, 812, 30, 930, 992, 132, 272, 210, 72, 1332, 342, 156, 240, 1640, 42, 1806, 132, 90, 506, 2162, 240, 2352, 600, 306, 156, 2756, 702, 110, 56, 342, 812, 3422, 240 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Equals A344005(n)*(A344005(n)+1). See A344005 for much more about this problem.

LINKS

Chai Wah Wu, Table of n, a(n) for n = 1..10000

CROSSREFS

Cf. A002378, A344005.

Sequence in context: A242882 A157285 A320068 * A275439 A173392 A324128

Adjacent sequences:  A345985 A345986 A345987 * A345989 A345990 A345991

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 13 2021

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 December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)