|
|
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
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
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.
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|