Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086408
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086408 a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=1, else a[n+1]=a[n]+4. +0
3
1, 5, 9, 13, 17, 21, 20, 24, 28, 32, 36, 35, 39, 43, 47, 46, 45, 49, 53, 52, 56, 60, 64, 68, 67, 66, 70, 69, 73, 72, 76, 80, 79, 83, 87, 91, 95, 94, 98, 102, 106, 105, 104, 108, 112, 111, 110, 109, 113, 117, 116, 120, 124, 128, 132, 136, 135, 139, 143, 142, 146, 150 (list; graph; listen)
OFFSET

1,2

COMMENT

There is a cycle starting with a(117)=270: ...270,274,273,272,271,270,...

EXAMPLE

a(3)=9 because a(2)=5, prime[5]=11=!=1 (mod 6) and a(3)=a(2)+4

MATHEMATICA

b=1; Prepend[Table[b+=If[Mod[Prime[b], 6]==1, -1, 4], {i, 152}], 1]

CROSSREFS

Cf. A086407, A086409.

Sequence in context: A116616 A080590 A051541 this_sequence A141135 A162502 A016813

Adjacent sequences: A086405 A086406 A086407 this_sequence A086409 A086410 A086411

KEYWORD

easy,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Jul 18 2003

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research