BBC Russian

A276942

Square array A(row,col): A(row,1) = A276937(row), and for col > 1, A(row,col) = A003961(A(row,col-1)), read by descending antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.

2, 3, 6, 5, 15, 9, 7, 35, 25, 10, 11, 77, 49, 21, 14, 13, 143, 121, 55, 33, 18, 17, 221, 169, 91, 65, 75, 22, 19, 323, 289, 187, 119, 245, 39, 26, 23, 437, 361, 247, 209, 847, 85, 51, 30, 29, 667, 529, 391, 299, 1859, 133, 95, 105, 34, 31, 899, 841, 551, 493, 3757, 253, 161, 385, 57, 38, 37, 1147, 961, 713, 589, 6137, 377, 319, 1001, 115, 69, 42

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

The starting offset is 2 because 1 is not included in the array proper. With it the terms are a permutation of A276078.

All terms on each row have the same prime signature.

LINKS

Antti Karttunen, Table of n, a(n) for n = 2..631; the first 35 antidiagonals of array

FORMULA

A(row,1) = A276937(row); for col > 1, A(row,col) = A003961(A(row,col-1)).

EXAMPLE

The top left corner of the array: