The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274318 Main diagonal of infinite Sudoku-type array A269526. 8

%I #18 Mar 07 2020 13:50:20

%S 1,4,6,5,2,10,8,3,7,9,16,26,29,22,20,23,28,38,12,32,46,13,14,11,15,56,

%T 35,58,47,48,24,18,21,69,17,52,41,19,82,83,70,25,30,62,93,27,65,106,

%U 78,102,37,110,112,76,116,119,92,31,34,49,39,101,33,36,138

%N Main diagonal of infinite Sudoku-type array A269526.

%C Conjectured to be a permutation of the natural numbers.

%H Alois P. Heinz, <a href="/A274318/b274318.txt">Table of n, a(n) for n = 1..1000</a>

%H F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, <a href="https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p52/8039">Queens in exile: non-attacking queens on infinite chess boards</a>, Electronic J. Combin., 27:1 (2020), #P1.52.

%t A[n_, k_] := A[n, k] = If[n == 1 && k == 1, 1, s = {Table[A[i, k], {i, 1, n - 1}], Table[A[n, j], {j, 1, k - 1}], Table[A[n - t, k - t], {t, 1, Min[n, k] - 1}], Table[A[n + j, k - j], {j, 1, k - 1}]} // Flatten; For[m = 1, True, m++, If[FreeQ[s, m], Return[m]]]];

%t a[n_] := A[n, n];

%t Array[a, 65] (* _Jean-François Alcover_, Jun 10 2017, after _Alois P. Heinz_ *)

%Y Cf. A269526, A274315, A274316, A274317.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Jun 29 2016

%E More terms from _Alois P. Heinz_, Jun 29 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 10:09 EDT 2024. Contains 373162 sequences. (Running on oeis4.)