The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A334007 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero triangular numbers in exactly n ways. 7
 1, 10, 2180, 10053736, 13291443468940 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..5. Eric Weisstein's World of Mathematics, Triangular Number Index to sequences related to polygonal numbers EXAMPLE Let S(k, m) denote the sum of m triangular numbers starting from k(k+1)/2. We have a(1) = S(1, 1); a(2) = S(4, 1) = S(1, 3); a(3) = S(31, 4) = S(27, 5) = S(9, 15); a(4) = S(945, 22) = S(571, 56) = S(968, 21) = S(131, 266); a(5) = S(4109, 38947) = S(25213, 20540) = S(10296, 32943) = S(32801, 15834) = S(31654, 16472). CROSSREFS Cf. A000217, A054859, A068314, A034706, A050943, A186337, A298467, A307666, A309783, A334008, A334010, A334011, A334012. Sequence in context: A328360 A114776 A249850 * A155870 A369811 A167775 Adjacent sequences: A334004 A334005 A334006 * A334008 A334009 A334010 KEYWORD nonn,hard,more AUTHOR Ilya Gutkovskiy, Apr 12 2020 EXTENSIONS a(5) from Giovanni Resta, Apr 13 2020 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.

Last modified September 7 23:52 EDT 2024. Contains 375749 sequences. (Running on oeis4.)