login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268060 Least k such that A268057(n, k) = A268058(n). 4

%I #9 Feb 13 2016 23:19:31

%S 1,1,2,3,3,4,4,5,5,6,7,7,8,9,8,9,10,11,12,13,13,14,14,13,16,15,16,17,

%T 16,17,20,19,20,25,22,22,21,24,22,23,24,23,27,28,29,29,30,29,31,32,31,

%U 33,32,32,36,33,35,35,34,34,37,39,38,41,41,40,43,43,44

%N Least k such that A268057(n, k) = A268058(n).

%C a(n) > n/2 for all n > 2.

%H Peter Kagey, <a href="/A268060/b268060.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A268057, A268058, A268059.

%K nonn

%O 1,3

%A _Peter Kagey_, Jan 25 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 02:46 EDT 2024. Contains 371917 sequences. (Running on oeis4.)