Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099722
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099722 From a 2-dimensional walk involving primes. +0
1
11, 17, 23, 41, 47, 67, 83 (list; graph; listen)
OFFSET

1,1

COMMENT

Start with 7 in the center cell. Rules: Write Prime(n-1) in a cell and,

if Prime(n-1) == 1 mod 5, then move to upper cell, append Prime(n) to the cell.

if Prime(n-1) == 2 mod 5, then move to right cell, append Prime(n) to the cell.

if Prime(n-1) == 3 mod 5, then move to lower cell, append Prime(n) to the cell.

if Prime(n-1) == 4 mod 5, then move to left cell, append Prime(n) to the cell.

Sequence gives sequence of primes appearing in the cell to the right of center cell.

EXAMPLE

.................. 13 ...... 13 ......... 13 .............. 13 .................

7 -> 7 : 11 -> 7 : 11 -> 7 : 11,17 -> 7 : 11,17 : 19 -> 7 : 11,17,23 : 19 -> ...

CROSSREFS

Cf. A096447.

Sequence in context: A063638 A141250 A096454 this_sequence A031505 A094524 A098412

Adjacent sequences: A099719 A099720 A099721 this_sequence A099723 A099724 A099725

KEYWORD

nonn,easy,more

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Nov 06 2004

page 1

Search completed in 0.005 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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research