A(n, k) is the smallest number x > A(n, k-1) such that every letter, with repetition, that occurs in the English name of A(n, k-1) also occurs in the English name of x, with A(n, 1) = n; square array, read by antidiagonals downwards.

A303380

A(n, k) is the smallest number x > A(n, k-1) such that every letter, with repetition, that occurs in the English name of A(n, k-1) also occurs in the English name of x, with A(n, 1) = n; square array, read by antidiagonals downwards.

Terms

    a(0) =1a(1) =14a(2) =2a(3) =74a(4) =21a(5) =3a(6) =147a(7) =120a(8) =13a(9) =4a(10) =174a(11) =121a(12) =37a(13) =14a(14) =5a(15) =471a(16) =1120a(17) =137a(18) =74a(19) =25a(20) =6a(21) =1135a(22) =1121a(23) =731a(24) =147a(25) =125a(26) =16a(27) =7a(28) =1531a(29) =14121

External references