cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A268060 #9 Feb 13 2016 23:19:31
%S A268060 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 A268060 16,17,20,19,20,25,22,22,21,24,22,23,24,23,27,28,29,29,30,29,31,32,31,
%U A268060 33,32,32,36,33,35,35,34,34,37,39,38,41,41,40,43,43,44
%N A268060 Least k such that A268057(n, k) = A268058(n).
%C A268060 a(n) > n/2 for all n > 2.
%H A268060 Peter Kagey, <a href="/A268060/b268060.txt">Table of n, a(n) for n = 1..10000</a>
%Y A268060 Cf. A268057, A268058, A268059.
%K A268060 nonn
%O A268060 1,3
%A A268060 _Peter Kagey_, Jan 25 2016