|
Search: id:A094290
|
|
|
| A094290 |
|
a(1) = 2 = prime(1). Then the first occurrence of prime(n) followed by all previous terms. i.e. If the index of first occurrence of prime(n) is k then the next k-1 terms are defined as a(k+r) = a(r), r = 1 to k-1. and a(2k) = prime(n+1) and so on. |
|
+0
1
|
|
| 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 11, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 13, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 11, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 17, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 11, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 2, 3, 2, 13, 2, 3, 2, 5, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Index of the first occurrence of prime(n)= 2^(n-1). Subsidiary sequences: If prime(n) is replaced by f(n) a large number of sequences can be obtained choosing f(n) = composite(n), f(n) = n^2,f(n) = n^r, r =3,4,5..., f(n) = tau(n), f(n) = sigma(n), f(n) = n!, f(n) = Fibonacci(n), f(n) = T(n), triangular number f(n) = n-th Bell, etc. each giving a distinct fascinating music.
|
|
CROSSREFS
|
Cf. A001511.
Sequence in context: A066727 A076606 A056927 this_sequence A101876 A087986 A129088
Adjacent sequences: A094287 A094288 A094289 this_sequence A094291 A094292 A094293
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 28 2004
|
|
|
Search completed in 0.002 seconds
|
