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.

A253173 Values n, where n = p * q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q.

Original entry on oeis.org

15628, 15678, 16038, 17082, 17820, 19084, 20457, 20754, 21658, 24507, 26910, 27504, 28156, 28651, 30976, 32890, 34902, 35046, 35496, 36508, 36970, 37096, 37690, 38870, 40596, 40898, 43076, 43670, 45068, 46740, 46970, 47690, 48504, 48592, 50076, 50346
Offset: 1

Views

Author

Randy L. Ekl, Dec 28 2014

Keywords

Examples

			a(1) is 15628 = 4 * 3907, using all 10 digits.
20748 = 13 * 1596, using all 10 digits, but is NOT a member of this sequence, because the digit 1 appears in both p and q.
		

Crossrefs

Cf. A195814 (a finite subsequence).
Cf. A253172 (a supersequence, which allows for duplicate digits in n, p and q).

Programs

  • PARI
    isok(n) = {fordiv(n, d, q = n/d; sn = vecsort(digits(n),,8); sd = vecsort(digits(d),,8); sq = vecsort(digits(q),,8); sa = vecsort(concat(sn, concat(sd, sq)),,8); if ((#sa == 10) && (#sn + #sd + #sq == 10), return (1));); return (0);} \\ Michel Marcus, Feb 07 2015