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!)
A101274 a(1)=1; for n>1, a(n) is the smallest positive integer such that the set of all sums of adjacent elements up to and including a(n) contains no number more than once. 5

%I #24 Sep 05 2023 18:39:54

%S 1,2,4,5,8,10,14,21,15,16,26,25,34,22,48,38,71,40,74,90,28,69,113,47,

%T 94,54,46,143,153,83,128,49,249,75,133,225,125,131,270,145,230,199,

%U 237,206,201,299,136,346,72,272,120,55,453,247,376,427,124,535,87,242,431,283,227,212,940,318,387,311,391,325

%N a(1)=1; for n>1, a(n) is the smallest positive integer such that the set of all sums of adjacent elements up to and including a(n) contains no number more than once.

%C Does the sequence together with the sums of adjacent elements include all positive integers? Choosing starting values other than a(1)=1 gives other sequences. We could ask, for a given n, which such sequences have the smallest sum of a(k) from k=1 to n.

%C The first differences of A005282. [_Zak Seidov_, Nov 06 2010]

%H Jean-Marc Falcoz, <a href="/A101274/b101274.txt">Table of n, a(n) for n = 1..483</a>

%H E. Giaquinta and S. Grabowski, <a href="http://arxiv.org/abs/1210.6176">New algorithms for binary jumbled pattern matching</a>, arXiv preprint arXiv:1210.6176 [cs.DS], 2012. - From _N. J. A. Sloane_, Jan 01 2013

%e a(8)=21 because the set of sums of adjacent elements to this point, call it s(7) is {1,2,3,4,5,6,7,8,9,10,11,12,13,14,17,18,19,20,23,24,27,29,30,32,37,41,43,44}.

%e The first number missing from this list is 15, but a(8) cannot equal 15 because 15+14=29 and 29 is already in s(7). Similarly a(8) cannot be 16 because 16+14=30.

%t t = {1}; sms = {2}; k = 1;

%t Do[k++; While[Intersection[sms, k + t] != {}, k++]; sms = Join[sms, t + k, {2 k}]; AppendTo[t, k], {41}];

%t Differences[t] (* _Jean-François Alcover_, Feb 13 2019, after _T. D. Noe_ in A005282 *)

%o (Python)

%o from itertools import count, islice

%o def A101274_gen(): # generator of terms

%o aset1, aset2, alist, n = {1}, set(), [1], 1

%o for k in count(2):

%o bset2 = {k<<1}

%o if (k<<1) not in aset2:

%o for d in aset1:

%o if (m:=d+k) in aset2:

%o break

%o bset2.add(m)

%o else:

%o yield k-n

%o n = k

%o alist.append(k)

%o aset1.add(k)

%o aset2.update(bset2)

%o A101274_list = list(islice(A101274_gen(),30)) # _Chai Wah Wu_, Sep 05 2023

%Y Cf. A005282.

%K nonn

%O 1,2

%A _David S. Newman_, Dec 20 2004

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 23 08:28 EDT 2024. Contains 371905 sequences. (Running on oeis4.)