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.

Showing 1-2 of 2 results.

A131929 Number of prime factors of n that are contained in decimal representation of n.

Original entry on oeis.org

0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2007

Keywords

Comments

a(A050695(n)) = 0; a(A131930(n)) > 0;
a(A131931(n)) = n and a(m) <> n for m < A131931(n).

Examples

			a(230) = a(23*5*2) = #{2,23} = 2.
		

Crossrefs

A318965 a(n) is the smallest number containing all its n prime factors in its decimal representation.

Original entry on oeis.org

2, 135, 735, 21372, 271362, 4773132, 113678565, 11317129824, 131175822960, 7113719552940, 255360234137190, 12411792985131540
Offset: 1

Views

Author

Giovanni Resta, Sep 06 2018

Keywords

Examples

			a(2) = 135 = 3^3 * 5,
a(3) = 735 = 3 * 5 * 7^2,
a(4) = 21372 = 2^2 * 3 * 13 * 137,
a(5) = 271362 = 2 * 3 * 7^2 * 13 * 71,
a(6) = 4773132 = 2^2 * 3^2 * 7 * 13 * 31 * 47.
a(7) = 113678565 = 3 * 5 * 7 * 11 * 13 * 67 * 113.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Block[{k=1, s, f}, While[True, k++; If[Length[f = FactorInteger[k]] == n, s = ToString@k; If[AllTrue[First /@ f, StringPosition[s, ToString@ #] != {} &], Break[]]]]; k]; Array[a, 5]
Showing 1-2 of 2 results.