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.

A036319 Composite numbers whose prime factors have no digits other than 4's and 9's.

Original entry on oeis.org

201601, 224051, 249001, 2244551, 2494501, 4467101, 4964551, 19957601, 22180051, 22225051, 22449551, 24700001, 24949501, 24990001, 42632101, 42654551, 47379551, 47404501, 49735051, 90518849, 98982601, 100598899, 111801449, 124251499, 199557601, 221780051, 222200551, 247445501
Offset: 1

Views

Author

Patrick De Geest, Dec 15 1998

Keywords

Comments

Closed under multiplication. - David A. Corneth, Sep 21 2020
From M. F. Hasler, Sep 22 2020: (Start)
Also closed under LCM, but not under GCD.
All terms are congruent to 1 or 9 (mod 10), depending on the parity of their number of prime factors counted with multiplicity, A001222. (End)

Examples

			The smallest prime made up of 4's and 9's is 449 (see A020466), so the smallest term here is 449^2 = 201601. - _N. J. A. Sloane_, Sep 21 2020
		

Crossrefs

Programs

  • Mathematica
    cn49Q[n_]:=Module[{fi=FactorInteger[n][[All,1]]},CompositeQ[n]&&Union[ Flatten[ IntegerDigits/@fi]]=={4,9}&&AllTrue[fi,PrimeQ]]; Select[Range[ 1,1006*10^5,2],cn49Q] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Sep 21 2020 *)
  • PARI
    is(N)={!isprime(N)&& !#setminus(Set(concat(apply (digits, factor(N)[,1]))), [4,9])} \\ M. F. Hasler, Sep 22 2020

Formula

Sum_{n>=1} 1/a(n) = Product_{p in A020466} (p/(p - 1)) - Sum_{p in A020466} 1/p - 1 = 0.00001523788893... . - Amiram Eldar, May 22 2022

Extensions

More terms from David A. Corneth, Sep 21 2020