login
This site is supported by donations 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
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, 37, 39, 40, 41, 43, 44, 46, 47, 48, 49, 50, 51, 52, 54, 55, 57, 61, 62, 63, 64, 66, 67, 70, 72, 73, 74, 75, 78, 79, 80, 81, 84, 88, 90, 91, 94, 95, 97, 99, 100, 102, 104, 105, 106, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

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

LINKS

Table of n, a(n) for n=1..70.

CROSSREFS

Sequence in context: A039100 A184482 A141204 * A096997 A187480 A081694

Adjacent sequences:  A160989 A160990 A160991 * A160993 A160994 A160995

KEYWORD

nonn

AUTHOR

Leroy Quet, Jun 01 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 04:38 EDT 2019. Contains 324318 sequences. (Running on oeis4.)