|
| |
| |
|
|
|
9, 21, 33, 45, 57, 69, 81, 93, 105, 117, 129, 141, 153, 165, 177, 189, 201, 213, 225, 237, 249, 261, 273, 285, 297, 309, 321, 333, 345, 357, 369, 381, 393, 405, 417, 429, 441, 453, 465, 477, 489, 501, 513, 525, 537, 549, 561, 573, 585, 597, 609, 621, 633
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Numbers k such that k mod 2 = (k+1) mod 3 = 1 and (k+2) mod 4 <> 1. - Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 15 2004
For n>3, the number of squares on the infinite 3-column chessboard at <=n knight moves from any fixed point. - R. Stephan, Sep 15 2004
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n)=6*(4n+1)-a(n-1) (with a(0)=9). [From Vincenzo Librandi, Dec 17 2010]
|
|
|
MATHEMATICA
| 12*Range[0, 200]+9 (*From Vladimir Joseph Stephan Orlovsky, Feb 19 2011*)
|
|
|
PROG
| (Other) sage: [i+9 for i in range(525) if gcd(i, 12) == 12] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 21 2009]
|
|
|
CROSSREFS
| Cf. A008594, A017533, A017545.
Sequence in context: A133929 A086470 A176256 * A176258 A107978 A043112
Adjacent sequences: A017626 A017627 A017628 * A017630 A017631 A017632
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
