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.

A347000 The (m^n)-th prime, written as square array T(n,m) read by falling antidiagonals.

This page as a plain text file.
%I A347000 #13 Aug 13 2021 01:37:36
%S A347000 2,3,2,5,7,2,7,23,19,2,11,53,103,53,2,13,97,311,419,131,2,17,151,691,
%T A347000 1619,1543,311,2,19,227,1321,4637,8161,5519,719,2,23,311,2309,10627,
%U A347000 28687,38873,19289,1619,2,29,419,3671,21391,79349,171529,180503,65687,3671,2
%N A347000 The (m^n)-th prime, written as square array T(n,m) read by falling antidiagonals.
%H A347000 Hugo Pfoertner, <a href="/A347000/b347000.txt">Table of k, a(k) for k = 1..351</a>, antidiagonals for m+n<=26, flattened.
%e A347000 The array begins
%e A347000   2   3     5      7     11      13       17 ...
%e A347000   2   7    23     53     97     151      227 ...
%e A347000   2  19   103    311    691    1321     2309 ...
%e A347000   2  53   419   1619   4637   10627    21391 ...
%e A347000   2 131  1543   8161  28687   79349   185707 ...
%e A347000   2 311  5519  38873 171529  567871  1549817 ...
%e A347000   2 719 19289 180503 994837 3950183 12579617 ...
%t A347000 T[n_,m_]:=Prime[m^n];Flatten[Table[Reverse[Table[T[n-m+1,m],{m,n}]],{n,10}]] (* _Stefano Spezia_, Aug 10 2021 *)
%Y A347000 Cf. A000040, A033844, A038833, A119772, A011757, A055875, A109791, A062448.
%Y A347000 Cf. A003320, A051129.
%K A347000 nonn,tabl
%O A347000 1,1
%A A347000 _Hugo Pfoertner_, Aug 10 2021