OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
With[{nn=60}, Take[Join[{1}, Union[First[#]^Last[#]&/@Union[Flatten[ Outer[List, Prime[Range[nn]], Fibonacci[Range[nn/6]]], 1]]]], 70]] (* Harvey P. Dale, Jun 05 2012 *)
fib[lim_] := Module[{s = {}, f = 1, k = 2}, While[f <= lim, AppendTo[s, f]; k++; f = Fibonacci[k]]; s]; seq[max_] := Module[{s = {1}, p = 2, e = 1, f = {}}, While[e > 0, e = Floor[Log[p, max]]; If[f == {}, f = fib[e], f = Select[f, # <= e &]]; s = Join[s, p^f]; p = NextPrime[p]]; Sort[s]]; seq[250] (* Amiram Eldar, Aug 09 2024 *)
PROG
(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
KEYWORD
easy,nonn
AUTHOR
Giovanni Teofilatto, Mar 15 2006; corrected Apr 23 2006
EXTENSIONS
Edited and corrected by Klaus Brockhaus, Apr 25 2006
STATUS
approved