cp's OEIS Frontend

A003057 n appears n - 1 times.

%I A003057 #75 Jul 27 2022 02:20:09
%S A003057 2,3,3,4,4,4,5,5,5,5,6,6,6,6,6,7,7,7,7,7,7,8,8,8,8,8,8,8,9,9,9,9,9,9,
%T A003057 9,9,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,12,12,
%U A003057 12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13,13,14,14,14,14
%N A003057 n appears n - 1 times.
%C A003057 The PARI functions t1, t2 can be used to read a triangular array T(n,k) (n >= 2, 1 <= k <= n - 1) by rows from left to right: n -> T(t1(n), t2(n)). - _Michael Somos_, Aug 23 2002
%C A003057 Smallest integer such that n-1 <= C(a(n),2). - _Frank Ruskey_, Nov 06 2007
%C A003057 a(n) = inverse (frequency distribution) sequence of A161680. - _Jaroslav Krizek_, Jun 19 2009
%C A003057 Taken as a triangle t(n, m) with offset 1, i.e., n >= m >= 1, this gives all positive integer limits r = r (a = m, b = A063929(n, m)) of the (a,b)-Fibonacci ratio F(a,b;k+1)/F(a,b;k) for k -> infinity. See the Jan 11 2015 comment on A063929. - _Wolfdieter Lang_, Jan 12 2015
%C A003057 Square array, T(n,k) = n + k + 2, n > = 0 and k >= 0, read by antidiagonals. Northwest corner:
%C A003057   2, 3, 4, 5, ...
%C A003057   3, 4, 5, 6, ...
%C A003057   4, 5, 6, 7, ...
%C A003057   5, 6, 7, 8, ...
%C A003057   ... - _Franck Maminirina Ramaharo_, Nov 21 2018
%C A003057 a(n) is the pair chromatic number of an empty graph with n vertices.  (The pair chromatic number of a graph G is the smallest number of colors for which G has a coloring where every vertex has two distinct colors, no adjacent vertices have a common color, and no pair of colors is repeated.) - _Allan Bickle_, Dec 26 2021
%H A003057 Vincenzo Librandi, <a href="/A003057/b003057.txt">Table of n, a(n) for n = 2..10000</a>
%H A003057 Allan Bickle, <a href="https://allanbickle.files.wordpress.com/2016/05/2tonejcpaper.pdf">2-Tone coloring of joins and products of graphs</a>, Congr. Numer. 217 (2013), 171-190.
%H A003057 Michael Somos, <a href="/A073189/a073189.txt">Sequences used for indexing triangular or square arrays</a>
%F A003057 a(n) = A002260(n) + A004736(n).
%F A003057 a(n) = A002024(n-1) + 1 = floor(sqrt(2*(n - 1)) + 1/2) + 1 = round(sqrt(2*(n - 1))) + 1. - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 21 2003
%F A003057 a(n) = ceiling((sqrt(8*n - 7) + 1)/2). - _Reinhard Zumkeller_, Aug 28 2001, modified by _Frank Ruskey_, Nov 06 2007, restored by _M. F. Hasler_, Jan 13 2015
%F A003057 a(n) = A080036(n-1) - (n - 1) for n >= 2. - _Jaroslav Krizek_, Jun 19 2009
%F A003057 G.f.: (2*x^2 + Sum_{n>=2} x^(n*(n - 1)/2 + 2))/(1 - x) = (x^2 + x^(15/8)*theta_2(0,sqrt(x))/2)/(1 - x) where theta_2 is the second Jacobi theta function. - _Robert Israel_, Jan 12 2015
%e A003057 (a,b)-Fibonacci ratio limits r(a,b) (see a comment above): as a triangle with offset 1 one has t(3, m) = 4 for m = 1, 2, 3. This gives the limits r(a = m,b = A063929(3, m)), i.e., r(1,12) = r(2,8) = r(3,4) = 4 (and the limit 4 appears only for these three (a,b) values). - _Wolfdieter Lang_, Jan 12 2015
%p A003057 seq(n$(n-1),n=2..15); # _Robert Israel_, Jan 12 2015
%t A003057 Flatten[Table[PadRight[{},n-1,n],{n,15}]] (* _Harvey P. Dale_, Feb 26 2012 *)
%o A003057 (PARI) t1(n)=floor(3/2+sqrt(2*n-2)) /* A003057 */
%o A003057 (PARI) t2(n)=n-1-binomial(floor(1/2+sqrt(2*n-2)),2) /* A002260(n-2) */
%o A003057 (Magma) [Round(Sqrt(2*(n-1)))+1: n in [2..60]]; // _Vincenzo Librandi_, Jun 23 2011
%o A003057 (Python)
%o A003057 from math import isqrt
%o A003057 def A003057(n): return (k:=isqrt(m:=n-1<<1))+int((m<<2)>(k<<2)*(k+1)+1)+1 # _Chai Wah Wu_, Jul 26 2022
%Y A003057 Cf. A002024, A002260.
%K A003057 nonn,easy
%O A003057 2,1
%A A003057 _N. J. A. Sloane_
%E A003057 More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 21 2003