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

 

Logo

110 people attended OEIS-50 (videos, suggestions); annual fundraising drive to start soon (donate); editors, please edit! (stack is over 300), your editing is more valuable than any donation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059363 Lexicographically smallest increasing sequence of positive integers such that A001222(a(i)+a(j)) = A001222(a(i)) + A001222(a(j)) for all 1<=i<j. 4

%I

%S 1,2,25,745,2306,7081,31945,435866,716881,733442,4106917,21714577

%N Lexicographically smallest increasing sequence of positive integers such that A001222(a(i)+a(j)) = A001222(a(i)) + A001222(a(j)) for all 1<=i<j.

%C The values of A001222(a(n)) are 0,1,2,2,2,... and are conjectured to be 2 for all n > 2.

%Y Cf. A059333.

%K nonn,more

%O 1,2

%A _Naohiro Nomoto_, Jan 28 2001

%E Edited by _Max Alekseyev_, Feb 22 2012

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

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

Last modified October 31 03:51 EDT 2014. Contains 248845 sequences.