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.

A102782 Repunit semiprimes.

Original entry on oeis.org

111, 1111, 11111, 1111111, 11111111111, 11111111111111111, 11111111111111111111111111111111111111111111111, 11111111111111111111111111111111111111111111111111111111111
Offset: 1

Views

Author

Shyam Sunder Gupta, Feb 11 2005

Keywords

Examples

			a(2)=1111 because 1111=11*101, so 1111 is semiprime as well as a repunit number.
		

Crossrefs

Cf. A046413 the repunit of length n has exactly 2 prime factors.

Programs

  • Mathematica
    Select[Table[FromDigits[PadRight[{},n,1]],{n,60}],PrimeOmega[#]==2&] (* Harvey P. Dale, Aug 28 2013 *)

Formula

a(n) = A000042(A046413(n-1)). - Ray Chandler, Sep 06 2005