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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A270306 Smallest number which is representable as a sum of n but no fewer consecutive nonnegative integers, or 0 for n > 1 if no such number exists. 1

%I #17 Dec 11 2021 04:30:06

%S 0,1,6,10,20,0,28,44,0,0,88,0,104,0,0,136,272,0,304,0,0,0,368,0,0,0,0,

%T 0,464,0,496,592,0,0,0,0,1184,0,0,0,1312,0,1376,0,0,0,1504,0,0,0,0,0,

%U 1696,0,0,0,0,0,1888,0,1952,0,0,2144,0,0,4288,0,0,0,4544

%N Smallest number which is representable as a sum of n but no fewer consecutive nonnegative integers, or 0 for n > 1 if no such number exists.

%H Ray Chandler, <a href="/A270306/b270306.txt">Table of n, a(n) for n = 1..10000</a>

%F a(A111774(n)) = 0.

%F a(A174090(n)) = A163172(n).

%e a(2) = 1 = 0 + 1 (two but no fewer terms)

%e a(3) = 6 = 1 + 2 + 3 (three but no fewer terms)

%e a(4) = 10 = 1 + 2 + 3 + 4 (four but no fewer terms)

%e a(5) = 20 = 2 + 3 + 4 + 5 + 6 (five but no fewer terms)

%e a(6) = 0, since no number needs six but no fewer terms

%e a(7) = 28 = 1 + 2 + 3 + 4 + 5 + 6 + 7 (seven but no fewer terms)

%Y Cf. A138591, A163172, A270296 to A270303.

%K nonn

%O 1,3

%A _Martin Renner_, Mar 14 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)