Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A017629
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A017629 (12n+9). +0
8
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 (list; graph; listen)
OFFSET

0,1

COMMENT

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

CROSSREFS

Sequence in context: A110701 A133929 A086470 this_sequence A107978 A043112 A043892

Adjacent sequences: A017626 A017627 A017628 this_sequence A017630 A017631 A017632

KEYWORD

nonn,easy

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research