|
Search: id:A086407
|
|
|
| A086407 |
|
a[1]=1; a[n+1]=a[n]-1 if mod[prime[a[n]],6]=5, else a[n+1]=a[n]+4. |
|
+0
3
|
|
| 1, 5, 4, 8, 12, 16, 15, 14, 18, 22, 26, 25, 29, 33, 32, 31, 35, 34, 38, 42, 46, 50, 54, 53, 57, 56, 55, 54, 53, 57, 56, 55, 54, 53, 57, 56, 55, 54, 53, 57, 56, 55, 54, 53, 57, 56, 55, 54, 53, 57, 56, 55, 54
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
There is a cycle ...54,53,57,56,55,54,...
|
|
EXAMPLE
|
a(3)=4 because a(2)=5, prime[5]=11=1 (mod 6) and a(3)=a(2)-1
|
|
MATHEMATICA
|
b=1; Prepend[Table[b+=If[Mod[Prime[b], 6]\[Equal]5, -1, 4], {i, 32}], 1]
|
|
CROSSREFS
|
Cf. A086408, A086409.
Sequence in context: A002340 A023845 A051555 this_sequence A090124 A097943 A077142
Adjacent sequences: A086404 A086405 A086406 this_sequence A086408 A086409 A086410
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Jul 18 2003
|
|
|
Search completed in 0.002 seconds
|
