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.
%I A309977 #9 Aug 26 2019 08:39:40 %S A309977 1,1,6,4,5,11,2,22,13,15,30,4,23,11,12,58,43,45,68,28,97,37,8,64,35, %T A309977 95,66,10,105,21,82,54,55,155,196,126,171,93,142,184,27,235,16,290, %U A309977 157,65,124,18,81,131,72,288,239,243,304,36,375,209,144,276,211 %N A309977 Position of n in row n of McGarvey's array; see A007062. %e A309977 McGarvey's array (from A007062): %e A309977 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 %e A309977 2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 %e A309977 4 1 2 5 6 3 10 7 8 11 12 9 16 13 14 17 18 15 22 19 %e A309977 5 2 1 4 7 10 3 6 9 12 11 8 17 14 13 16 19 22 15 18 %e A309977 7 4 1 2 5 12 8 6 3 10 13 14 17 8 11 18 15 22 19 16 %e A309977 12 5 2 1 4 7 14 13 10 3 6 8 22 15 18 11 8 17 24 23 %e A309977 14 7 4 1 2 5 12 15 22 8 6 3 10 13 20 23 24 17 8 11 %e A309977 15 12 5 2 1 4 7 14 23 20 13 10 3 6 8 22 25 28 31 18 %e A309977 In row 3, the entry 3 occurs in position 6, so that a(3) = 6. %t A309977 s[0] = Range[10000]; s[n_] := Flatten[Map[Reverse, Partition[s[n - 1], n]]]; %t A309977 Flatten[Table[Position[s[n], n], {n, 1, 500}]] %Y A309977 Cf. A007062. %K A309977 nonn,easy %O A309977 1,3 %A A309977 _Clark Kimberling_, Aug 25 2019