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!)
A118236 Numbers that can be written as sums of at least two distinct but overlapping sets of consecutive numbers. 3

%I #11 Nov 22 2019 12:42:17

%S 9,15,18,21,30,35,42,45,50,55,60,63,65,70,75,77,81,84,90,91,99,105,

%T 108,117,119,126,132,133,135,140,143,147,150,153,154,156,162,165,171,

%U 175,180,187,189,195,196,198,207,209,210,216,220,221,225,231,234,245,247

%N Numbers that can be written as sums of at least two distinct but overlapping sets of consecutive numbers.

%C A001227(a(n)) > 2.

%C Complement of A328369. - _Omar E. Pol_, Nov 19 2019

%H Alois P. Heinz, <a href="/A118236/b118236.txt">Table of n, a(n) for n = 1..10000</a>

%e 30 = 4+5+(6+7+8) = (6+7+8)+9 with common summands = {6,7,8}, therefore 30 is a term.

%t Position[#, _?(# > 0 &)][[All, 1]] &@ Array[Count[Tally@ Flatten@ Select[IntegerPartitions[#], Union@ Differences@ # == {-1} &], _?(Last@ # > 1 &)] &, 60] (* _Michael De Vlieger_, Nov 22 2019 *)

%Y Cf. A328369.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Apr 18 2006

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 April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)