Pontus von Brömssen, <a href="/A229607/b229607_1.txt">Table of n, a(n) for n = 1..5050</a> (first 100 antidiagonals)
Pontus von Brömssen, <a href="/A229607/b229607_1.txt">Table of n, a(n) for n = 1..5050</a> (first 100 antidiagonals)
proposed
approved
editing
proposed
Square array read by antidiagonals downwards: in which each row starts with the least prime not in a previous row, and each prime p in a row is followed by the greatest prime < 2*p.
ArraySquare array read by antidiagonals downwards: each row starts with the least prime not in a previous row, and each prime p in a row is followed by the greatest prime < 2*p.
proposed
editing
editing
proposed
Pontus von Brömssen, <a href="/A229607/b229607_1.txt">Table of n, a(n) for n = 1..5050</a> (first 100 antidiagonals)
approved
editing
reviewed
approved