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.

A260233 Smallest prime factor of the n-th hexagonal number (A000384).

Original entry on oeis.org

2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 19, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 31, 2, 3, 2, 3, 2, 37, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 11, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 79, 2, 3, 2, 3, 2, 5, 2
Offset: 2

Views

Author

Colin Barker, Jul 20 2015

Keywords

Examples

			a(3) = 3 because A000384(3) = 15 = 3 * 5.
		

Crossrefs

Programs

  • Mathematica
    Table[FactorInteger[n(2n-1)][[1,1]],{n,2,100}] (* Harvey P. Dale, May 05 2016 *)
  • PARI
    pg(m, n) = (n^2*(m-2)-n*(m-4))/2 \\ n-th m-gonal number
    spf(m) = factorint(m)[1,1] \\ Smallest prime factor
    a(n) = spf(pg(6, n))

Formula

a(n) = A020639(A000384(n)).