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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A207975 Triangle where row n consists of a sequence of n positive integers g(1) < g(2) < ... < g(n) with the minimal sum such that A001222(g(i)+g(j)) = A001222(g(i)) + A001222(g(j)) for all 1 <= i < j <= n. 1
1, 1, 2, 2, 6, 10, 3, 9, 19, 43, 5, 15, 29, 39, 53, 5, 15, 29, 39, 53, 173, 5, 39, 53, 111, 173, 237, 293, 7, 35, 67, 151, 211, 215, 547, 607, 5, 29, 113, 269, 353, 449, 509, 634, 1613, 41, 99, 201, 521, 597, 761, 921, 1193, 1361, 1761 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

EXAMPLE

The triangle starts with:

n=1: 1

n=2: 1, 2

n=3: 2, 6, 10

n=4: 3, 9, 19, 43

n=5: 5, 15, 29, 39, 53

n=6: 5, 15, 29, 39, 53, 173

n=7: 5, 39, 53, 111, 173, 237, 293

n=8: 7, 35, 67, 151, 211, 215, 547, 607

n=9: 5, 29, 113, 269, 353, 449, 509, 634, 1613

...

CROSSREFS

Row sums are given by A059393.

Cf. A059363.

Sequence in context: A192659 A327485 A051765 * A321623 A077063 A081728

Adjacent sequences:  A207972 A207973 A207974 * A207976 A207977 A207978

KEYWORD

nonn,tabl

AUTHOR

Max Alekseyev, Feb 22 2012

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 December 13 20:27 EST 2019. Contains 329973 sequences. (Running on oeis4.)