id:A153125 - OEIS Search Results

Search: id:A153125

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) = maximal number of squares that can be covered by a queen on an n X k chessboard, 1<=k<=n.

+0
4

1, 2, 4, 3, 6, 9, 4, 7, 10, 12, 5, 8, 11, 14, 17, 6, 9, 12, 15, 18, 20, 7, 10, 13, 16, 19, 22, 25, 8, 11, 14, 17, 20, 23, 26, 28, 9, 12, 15, 18, 21, 24, 27, 30, 33, 10, 13, 16, 19, 22, 25, 28, 31, 34, 36, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 12, 15, 18, 21, 24, 27, 30, 33, 36 (list; table; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Sums of rows give A153126; central terms give A016861;` `A047461(n) = T(n,n);` `T(n,2k-1) = T(n-1,2k-1) + 1 for 2*k-1<n.`
	FORMULA	`T(n,k) = n + 3(k-1) - (1 - n Mod 2)0^(n-k), 1<=k<=n.`
	CROSSREFS	`Sequence in context: A077661 A139413 A077583 this_sequence A075362 A110749 A077529` `Adjacent sequences: A153122 A153123 A153124 this_sequence A153126 A153127 A153128`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 20 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research