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.

A185728 Array associated with squares, by antidiagonals.

This page as a plain text file.
%I A185728 #11 Jul 12 2017 03:17:40
%S A185728 1,2,3,5,4,8,10,6,7,15,17,11,9,14,24,26,18,12,13,23,35,37,27,19,16,22,
%T A185728 34,48,50,38,28,20,21,33,47,63,65,51,39,29,25,32,46,62,80,82,66,52,40,
%U A185728 30,31,45,61,79,99,101,83,67,53,41,36,44,60,78,98,120,122,102,84,68,54,42,43,59,77,97,119,143,145,123,103,85,69,55,49,58,76,96,118,142,168,170,146,124,104,86,70,56,57,75,95,117,141,167,195
%N A185728 Array associated with squares, by antidiagonals.
%C A185728 Every positive integer occurs exactly once; hence, as a sequence, A185725 is a permutation of the positive integers.  The square with corners T(0,0)=1 and T(n,n)=n^2 is occupied by the numbers 1,2,...,n^2.
%C A185728 T(1,k)=(k-1)^2+1 (A002522)
%C A185728 T(n,1)=-1+n^2 for n>=2.
%H A185728 G. C. Greubel, <a href="/A185728/b185728.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F A185728 T(n,k)=(k-1)^2+n if n<k; T(n,n)=n^2; T(n,k)=n^2-k if n>k.
%e A185728 Northwest corner:
%e A185728 1...2...5...10...17
%e A185728 3...4...6...11...18
%e A185728 8...7...9...12...19
%e A185728 15..14..13..16...20
%t A185728 f[n_,k_]:=(k-1)^2+n/; k>n;
%t A185728 f[n_,n_]:=n^2; f[n_,k_]:=n^2-k/; k<n;
%t A185728 TableForm[Table[f[n,k],{n,1,10},{k,1,15}]]
%t A185728 Table[f[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten
%Y A185728 Cf. A185725, A185726, A060734.
%K A185728 nonn,tabl
%O A185728 1,2
%A A185728 _Clark Kimberling_, Feb 01 2011