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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097285 Contains exactly once every pair (i,j) of distinct positive integers. 3
1, 2, 1, 3, 2, 3, 1, 4, 2, 4, 3, 4, 1, 5, 2, 5, 3, 5, 4, 5, 1, 6, 2, 6, 3, 6, 4, 6, 5, 6, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 8, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 9, 1, 10, 2, 10, 3, 10, 4, 10, 5, 10, 6, 10, 7, 10, 8, 10, 9, 10, 1, 11, 2, 11, 3, 11, 4, 11, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

Juxtapose segments: 1 2, then 1 3 2 3, then 1 4 2 4 3 4. General segment is 1 n 2 n ... n-1 n, followed by 1, so that clearly, every i<j and every i>j is uniquely present.

CROSSREFS

Cf. A097286.

Sequence in context: A159918 A108663 A057940 * A057432 A215467 A038568

Adjacent sequences:  A097282 A097283 A097284 * A097286 A097287 A097288

KEYWORD

nonn

AUTHOR

Clark Kimberling, Aug 05 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 18:16 EDT 2013. Contains 226415 sequences.