|
Search: id:A098499
|
|
|
| A098499 |
|
Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the diagonal. |
|
+0
4
|
|
| 1, 5, 23, 57, 109, 169, 246, 334, 439, 555, 688, 832, 993, 1165, 1354, 1554, 1771, 1999, 2244, 2500, 2773, 3057, 3358, 3670, 3999, 4339, 4696, 5064, 5449, 5845, 6258, 6682, 7123, 7575, 8044, 8524, 9021, 9529, 10054, 10590, 11143, 11707
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
(1/4) [28n^2 - 6n + 9 + 3(-1)^n], for n>3.
|
|
EXAMPLE
|
5 squares are reachable after 1 move, from these you can reach 18 new squares more, so a(1)=5, a(2)=23.
|
|
CROSSREFS
|
Equals A098498(n) - A052938(n-4), n>3.
See A018836 (unbounded), A098498 (halfplane), A098500 (quadrant), A098501 (octant).
Sequence in context: A019267 A053664 A092544 this_sequence A075565 A075707 A126420
Adjacent sequences: A098496 A098497 A098498 this_sequence A098500 A098501 A098502
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 15 2004
|
|
|
Search completed in 0.002 seconds
|
