|
Search: id:A008590
|
|
| |
|
| 0, 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
For n>3, the number of squares on the infinite 4-column half-strip chessboard at <=n knight moves from any fixed point on the short edge.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 320
|
|
FORMULA
|
a(n)= (2*n+1)^2-(2*n-1)^2 - Xavier Acloque Oct 22 2003
|
|
MAPLE
|
with(finance):seq(add(cashflows([2, 2, 4], 0 ), k=1..n), n=0..44); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
|
|
CROSSREFS
|
Cf. A010014.
Essentially the same as A022144.
Sequence in context: A037989 A044848 A044893 this_sequence A022144 A061824 A085131
Adjacent sequences: A008587 A008588 A008589 this_sequence A008591 A008592 A008593
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
