|
Search: id:A115975
|
|
|
| A115975 |
|
Numbers of the form p^k, where p is a prime and k is a Fibonacci number. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Subsequence of A000961 (prime powers).
|
|
PROGRAM
|
(PARI) {m=240; v=Set([]); forprime(p=2, m, i=0; while((s=p^fibonacci(i))<m, v=setunion(v, Set(s)); i++)); v=vecsort(eval(v)); for(j=1, #v, print1(v[j], ", "))}
|
|
CROSSREFS
|
Cf. A000961, A117245 (partial sums).
Sequence in context: A127072 A056781 A079446 this_sequence A087797 A153730 A140691
Adjacent sequences: A115972 A115973 A115974 this_sequence A115976 A115977 A115978
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Mar 15 2006; corrected Apr 23 2006
|
|
EXTENSIONS
|
Edited and corrected by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 25 2006
|
|
|
Search completed in 0.002 seconds
|
