cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A359852 a(n) is the smallest Fibonacci n-step number with exactly n distinct prime factors.

Original entry on oeis.org

21, 504, 39648, 6930, 12669125245488, 471771076278370, 32818036405994618064, 71577732779401085355729600, 204945946670840805166309694624676331385919836360545974559162291811394735721440
Offset: 2

Views

Author

Ilya Gutkovskiy, Jan 15 2023

Keywords

Examples

			a(3) = 504, because 504 is a tribonacci number with 3 distinct prime factors {2, 3, 7} and this is the smallest such number.
		

Crossrefs

Programs

  • 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

Extensions

a(10) from Jinyuan Wang, Jan 16 2023