login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
2,1
LINKS
Eric Weisstein's World of Mathematics, Distinct Prime Factors
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
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
Ilya Gutkovskiy, Jan 15 2023
EXTENSIONS
a(10) from Jinyuan Wang, Jan 16 2023
STATUS
approved