login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125566 a(1)=1. Take the positive integers, then reverse the order of the integers a(m+1) through a(m+a(n)), where m = 1 + sum{k=1 to n-1} a(k). 0
1, 2, 4, 3, 8, 7, 6, 5, 11, 10, 9, 19, 18, 17, 16, 15, 14, 13, 12, 26, 25, 24, 23, 22, 21, 20, 32, 31, 30, 29, 28, 27, 37, 36, 35, 34, 33, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 67, 66, 65, 64, 63, 62, 61, 60, 59, 86, 85, 84, 83, 82 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This sequence is a self-inverse permutation of the positive integers.

LINKS

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

EXAMPLE

The sequence grouped by descending runs, where the n-th descending run, after the first 1, is made up of a(n) terms: 1, (2), (4, 3), (8, 7, 6, 5), (11, 10, 9), (19, 18, 17, 16, 15, 14, 13, 12), (26, 25, 24, 23, 22, 21, 20), (32, 31, 30, 29, 28, 27), (37, 36, 35, 34, 33), (48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38), ...

CROSSREFS

Sequence in context: A066194 A101283 A243496 * A255833 A166133 A237739

Adjacent sequences:  A125563 A125564 A125565 * A125567 A125568 A125569

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jan 01 2007

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 January 19 20:33 EST 2019. Contains 319310 sequences. (Running on oeis4.)