|
Search: id:A061303
|
|
|
| A061303 |
|
Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)). |
|
+0
2
|
|
| 2, 5, 13, 17, 19, 31, 37, 41, 43, 61, 67, 71, 73, 79, 89, 97, 101, 109, 113, 127, 131, 137, 139, 151, 157, 163, 181, 193, 197, 199, 211, 223, 229, 233, 239, 241, 251, 257, 271, 277, 281, 307, 313, 331, 337, 349, 353, 373, 379, 397, 401, 409, 419, 421, 431, 433
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
It is conjectured for primes p and q the sequences S(p) and S(q) are disjoint, unless one is contained in the other.
|
|
REFERENCES
|
Amarnath Murthy, On the divisors of Smarandache Unary Sequence. Smarandache Notions Journal, Vol. 11, No. 1-2-3, Spring 2000.
Amarnath Murthy, Smarandache Prime Generator Sequence (to be published in Smarandache Notions Journal).
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
a(0)=2 so S(a(0))={2,3,7,29,...}, which is A061092. Hence a(1)=5 so S(a(1))={5,11,23,47,...}. Hence a(2)=13 so S(a(2))={13,53,107,643,...}, ...
|
|
MATHEMATICA
|
s[p_, 0] := s[p, 0]=p; s[p_, n_] := s[p, n]=Module[{q}, For[q=s[p, n-1]+1, !PrimeQ[q], q+=s[p, n-1], Null]; q]; ins[q_, p_] := Module[{k}, For[k=0, s[p, k]<=q, k++, If[s[p, k]==q, Return[True]]]; False]; a[0]=2; a[n_] := a[n]=Module[{i, j, q}, For[i=1, True, i++, q=Prime[i]; For[j=0, j<n, j++, If[ins[q, a[j]], Break[]]]; If[j==n, Return[q]]]]
|
|
CROSSREFS
|
Cf. A061092.
Sequence in context: A038914 A019419 A139254 this_sequence A019362 A075451 A109515
Adjacent sequences: A061300 A061301 A061302 this_sequence A061304 A061305 A061306
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 26 2001
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jun 09 2002
|
|
|
Search completed in 0.002 seconds
|
