|
Search: id:A112279
|
|
|
| A112279 |
|
a(0)=1; a(n)=prime(mod(a(n-1),100)). |
|
+0
3
|
|
| 1, 2, 3, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127, 103, 5, 11, 31, 127
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Starting with the third term, cycles every five terms. - Robert G. Wilson v (rgwv(at)rgwv.com), Dec 13 2005
|
|
REFERENCES
|
Zak Seidov, Posting to Seq Fan mailing list, Nov 28 2005
|
|
MATHEMATICA
|
a[0] = 1; a[n_] := a[n] = Prime[Mod[a[n - 1], 100]], Table[ a[n], {n, 0, 66}] (* RGWV *)
|
|
CROSSREFS
|
Sequence in context: A073680 A079557 A090709 this_sequence A130166 A007097 A132745
Adjacent sequences: A112276 A112277 A112278 this_sequence A112280 A112281 A112282
|
|
KEYWORD
|
nonn,less
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 24 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 13 2005
|
|
|
Search completed in 0.002 seconds
|
