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.

A070323 Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).

This page as a plain text file.
%I A070323 #24 Aug 10 2025 17:01:42
%S A070323 2,2,4,8,32,64,256,512,2048,12288,24576,147456,589824,1179648,4718592,
%T A070323 28311552,169869312,339738624,2038431744,8153726976,16307453952,
%U A070323 97844723712,391378894848,2348273369088,18786186952704,75144747810816
%N A070323 Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).
%C A070323 If A_n is the n X n matrix a(i,j) = Max(prime(i), prime(j)) then det(A_n)/det(M_n) = prime(n)/2.
%F A070323 a(n) = 2*A037169(n)/prime(n) for n > 1.
%F A070323 a(n) = 2*Product_{i=1..n-1} A001223(i) for n > 1. - _Luca Onnis_, Aug 13 2022
%F A070323 a(n) = 2 * A081411(n-1) for n >= 2. - _Alois P. Heinz_, Aug 17 2022
%t A070323 a[n_] := 2*Product[Differences[Prime[Range[100]]][[i]], {i, 1, n - 1}]; Table[a[n], {n, 1, 30}] (* _Luca Onnis_, Aug 13 2022 *)
%o A070323 (PARI) a(n) = matdet(matrix(n, n, i, j, min(prime(i), prime(j)))); \\ _Michel Marcus_, Aug 13 2022
%Y A070323 Cf. A001223, A037169, A081411.
%K A070323 easy,nonn
%O A070323 1,1
%A A070323 _Benoit Cloitre_, May 11 2002