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!)
A160992 a(1) = 1. For n >=2, a(n) = the smallest integer > a(n-1) such that sum{k=1 to r} a(k) doesn't equal any value of sum{k=1 to q} a(n+1-k), for any positive integer r, and for any positive integers q <= n-1. 1

%I

%S 1,2,4,5,6,8,9,10,11,13,14,15,17,19,21,22,24,25,28,29,30,31,32,34,36,

%T 37,39,40,41,43,44,46,47,48,49,50,51,52,54,55,57,61,62,63,64,66,67,70,

%U 72,73,74,75,78,79,80,81,84,88,90,91,94,95,97,99,100,102,104,105,106,107

%N a(1) = 1. For n >=2, a(n) = the smallest integer > a(n-1) such that sum{k=1 to r} a(k) doesn't equal any value of sum{k=1 to q} a(n+1-k), for any positive integer r, and for any positive integers q <= n-1.

%C The terms of this sequence were calculated by Hagen von EItzen.

%C sum{k=1 to q} a(n+1-k) obviously does equal sum{k=1 to r} a(k) for q = n = r.

%K nonn

%O 1,2

%A _Leroy Quet_, Jun 01 2009

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 July 1 16:27 EDT 2022. Contains 354973 sequences. (Running on oeis4.)