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 A146985 #8 Jun 29 2023 22:11:28
%S A146985 1,2,2,3,4,3,5,6,6,5,7,10,9,10,7,11,14,15,15,14,11,13,22,21,25,21,22,
%T A146985 13,17,26,33,35,35,33,26,17,19,34,39,55,49,55,39,34,19,23,38,51,65,77,
%U A146985 77,65,51,38,23,29,46,57,85,91,121,91,85,57,46,29
%N A146985 Triangle T(n,m) = f(n-m)*f(n), where f(n) = A008578(n+1).
%C A146985 I call this sequence "symmetrical spooky primes" as two prime combinations are used in cryptography.
%C A146985 Row sums are:{1, 4, 10, 22, 43, 80, 137, 222, 343, 508, 737}. The sequence to Floor[n/2] is a way to get all the combinations of primes with one less than the other.
%e A146985 Triangle T(n,m), n, m >= 0 begins:
%e A146985 1
%e A146985 2, 2
%e A146985 3, 4, 3
%e A146985 5, 6, 6, 5
%e A146985 7, 10, 9, 10, 7
%e A146985 11, 14, 15, 15, 14, 11
%e A146985 13, 22, 21, 25, 21, 22, 13
%e A146985 17, 26, 33, 35, 35, 33, 26, 17
%e A146985 19, 34, 39, 55, 49, 55, 39, 34, 19
%e A146985 23, 38, 51, 65, 77, 77, 65, 51, 38, 23
%e A146985 29, 46, 57, 85, 91, 121, 91, 85, 57, 46, 29
%t A146985 Clear[f, t, n, m]; f[n_] := If[n == 0, 1, Prime[n]]; t[n_, m_] = f[n - m]*f[m]; Table[t[n, m], {n, 0, 10}, {m, 0, n}]; Flatten[%]
%K A146985 easy,nonn,tabl
%O A146985 0,2
%A A146985 _Roger L. Bagula_, Nov 04 2008
%E A146985 Edited by _Peter Munn_, Jun 29 2023