|
| |
|
|
A008590
|
|
Multiples of 8.
|
|
22
| |
|
|
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, 344, 352, 360, 368, 376, 384, 392, 400, 408, 416, 424, 432
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| 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.
First differences of odd squares: a(n)=A016754(n)-A016754(n-1) for n>0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 08 2009]
Complement of A047592; A168181(a(n)) = 0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2009]
|
|
|
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
a(n) = 8*n = 2*a(n-1)-a(n-2). G.f.: 8*x/(x-1)^2. [From Vincenzo Librandi, Dec 24 2010]
|
|
|
MATHEMATICA
| Table[8*n, {n, 0, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 03 2010]
|
|
|
CROSSREFS
| Cf. A010014.
Essentially the same as A022144.
Sequence in context: A185359 A022144 A181390 * A186544 A061824 A085131
Adjacent sequences: A008587 A008588 A008589 * A008591 A008592 A008593
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
