id:A065775 - OEIS Search Results

Search: id:A065775

Displaying 1-1 of 1 results found.

page 1

Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard infinite in all directions from (0,0) to (i,j).

+0
1

0, 3, 3, 2, 2, 2, 3, 1, 1, 3, 2, 2, 4, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 2, 2, 2, 4, 4, 5, 3, 3, 3, 3, 3, 3, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 3, 3, 3, 3, 5, 5, 5, 6, 6, 4, 4, 4, 4, 4, 4, 4, 6, 6, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7 (list; table; graph; listen)

	OFFSET	`0,2`
	EXAMPLE	`Diagonals (each starting on row 0): {0}; {3,3}; {2,2,2}; {3,1,1,3}; ...`
	CROSSREFS	`Identical to A049604 except for T(1, 1).` `Sequence in context: A064983 A124933 A133884 this_sequence A096837 A139092 A021305` `Adjacent sequences: A065772 A065773 A065774 this_sequence A065776 A065777 A065778`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Stewart Gordon (smjg(AT)iname.com), Dec 05 2001`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research