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.

A258570 Smallest prime factors of 5-full numbers, a(1)=1.

Original entry on oeis.org

1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 5, 2, 3, 2, 2, 2, 5, 2, 7, 3, 2, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 7, 2, 2, 2, 11, 3, 2, 2, 2, 2, 2, 2, 13, 2, 5, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 7, 2, 2, 2, 2, 2, 2, 2, 17, 2, 3, 2, 2, 11, 2, 5, 2, 2, 2, 2, 2, 3, 19, 2, 2, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 06 2015

Keywords

Crossrefs

Programs

  • Haskell
    a258570 = a020639 . a069492
    
  • PARI
    lista(kmax) = {my(f); print1(1, ", "); for(k = 2, kmax, f = factor(k); if(vecmin(f[, 2]) > 4, print1(f[1, 1], ", "))); } \\ Amiram Eldar, Sep 12 2024

Formula

a(n) = A020639(A069492(n)).
a(A258602(n)) = A000040(n) and a(m) != A000040(n) for m < A258602(n).