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

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!)
 A334012 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero octagonal numbers in exactly n ways. 7
 1, 1045, 5985 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Eric Weisstein's World of Mathematics, Octagonal Number EXAMPLE From Seiichi Manyama, May 16 2021: (Start) Let S(k, m) denote the sum of m octagonal numbers starting from k*(3*k-2). We have a(1) = S(1, 1); a(2) = S(19, 1) = S(1, 10); a(3) = S(45, 1) = S(11, 9) = S(1, 18). (End) CROSSREFS Cf. A000567, A054859, A068314, A186337, A298467, A322637, A334007, A334008, A334010, A334011, A344376. Sequence in context: A345514 A345767 A324320 * A344376 A023067 A344410 Adjacent sequences:  A334009 A334010 A334011 * A334013 A334014 A334015 KEYWORD nonn,hard,more AUTHOR Ilya Gutkovskiy, Apr 12 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 14:10 EST 2021. Contains 349430 sequences. (Running on oeis4.)