|
Search: id:A076367
|
|
|
| A076367 |
|
Primes with subscripts from the Bonse sequence. |
|
+0
2
|
|
| 2, 3, 3, 5, 5, 5, 7, 7, 7, 11, 11, 11, 11, 11, 13, 13, 13, 17, 17, 17, 17, 17, 19, 19, 19, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 29, 31, 31, 31, 37, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 41, 43, 43, 43, 47, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 53, 59, 59, 59, 59, 59
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This and sequence A060646 was used to prove that 30 is the largest number such that its RRS does not contain composite numbers. See A048597, A060646 and corresponding References.
|
|
FORMULA
|
a(n)=Prime[A060646(n)]
|
|
MATHEMATICA
|
c[x_, j_] := x+1-(j+Prime[j])c[x, 0]=x; a=1000; t=Table[0, {a}]; t1=Table[0, {a}]; Table[fl=1; (*Print["% ", u, " #"]; *)Do[s=c[u, n]; If[Equal[fl, 1]&&Equal[Sign[s], -1], Print[n]; t[[u]]=n; t1[[u]]=Prime[n]; fl=0], {n, 1, u}], {u, 1, a}] //t (*=A060646*)//t1 (*=A076367*)
|
|
CROSSREFS
|
Cf. A048597, A060646, A076368. See also A076366.
Sequence in context: A066658 A005145 A156350 this_sequence A098567 A086162 A036703
Adjacent sequences: A076364 A076365 A076366 this_sequence A076368 A076369 A076370
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 14 2002
|
|
|
Search completed in 0.005 seconds
|
