|
|
A359852
|
|
a(n) is the smallest Fibonacci n-step number with exactly n distinct prime factors.
|
|
2
|
|
|
21, 504, 39648, 6930, 12669125245488, 471771076278370, 32818036405994618064, 71577732779401085355729600, 204945946670840805166309694624676331385919836360545974559162291811394735721440
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 504, because 504 is a tribonacci number with 3 distinct prime factors {2, 3, 7} and this is the smallest such number.
|
|
PROG
|
(PARI) a(n) = my(v=vector(n+1), x=1, y=n+1); v[1]=v[y]=1; while(omega(v[x])!=n, y=x; x=x%(n+1)+1; v[x]=2*v[y]-v[x]); v[x]; \\ Jinyuan Wang, Jan 16 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|