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.

Previous Showing 11-12 of 12 results.

A277061 Numbers with multiplicative digital root > 0.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 49, 51, 53, 57, 61, 62, 63, 64, 66, 67, 68, 71, 72, 73, 74, 75, 76, 77, 79, 81, 82, 83, 84, 86, 88, 89, 91, 92, 93, 94, 97, 98, 99, 111, 112, 113, 114, 115
Offset: 1

Views

Author

J. Lowell, Sep 26 2016

Keywords

Comments

Question: when will numbers not in this sequence outnumber numbers in this sequence? Up to n = 1249, there are 524 terms, so 525 terms not in this sequence. Up to n = 1522, there are n/2 terms. No n > 1522 has that property. Up to 10^10, only about 1.46% of numbers are a term.
To find how many terms there are up to 10^n, see if A009994(i) is for 2 <= i <= binomial(n + 9, 9). If it is then that adds A047726(A009994(i)) to the total (we don't have to worry about digits 0 in A009994(i) as there aren't any for the specified i). One may put further constraints on i. For example, A009994(i) can't contain an even digit and a 5 in the same number. - David A. Corneth, Sep 27 2016

Examples

			25 is not in this sequence because 2*5 = 10 and 1*0 = 0.
		

Crossrefs

Cf. A031347, A034048 (complement).
Cf. A028843 (a subsequence).
Union of A002275, A034049, A034050, A034051, A034052, A034053, A034054, A034055, A034056 (numbers having multiplicative digital roots 1-9).
Cf. A052382 (a supersequence).

Programs

  • Mathematica
    Select[Range@ 112, FixedPoint[Times @@ IntegerDigits@ # &, #] > 0 &] (* Michael De Vlieger, Sep 26 2016 *)
  • PARI
    is(n) = n=digits(n); while(#n>1,n=digits(prod(i=1,#n,n[i]))); #n>0 \\ David A. Corneth, Sep 27 2016

Extensions

More terms from Michael De Vlieger, Sep 26 2016

A201024 Composite numbers whose multiplicative digital root is 9.

Original entry on oeis.org

9, 33, 91, 119, 133, 1119, 1133, 1191, 1313, 1331, 1911, 3113, 3131, 3311, 9111, 11133, 11191, 11313, 11331, 11911, 13113, 13131, 13311, 19111, 31113, 31131, 31311, 33111, 91111, 111133, 111313, 111331, 111911, 113113, 113311, 119111, 131131, 133111, 191111, 311113
Offset: 1

Views

Author

Jaroslav Krizek, Nov 25 2011

Keywords

Comments

Also composite numbers whose product of digits is 9. Complement of A107695 with respect to A034056.

Examples

			Number 133 is in sequence because 1*3*3=9.
		

Crossrefs

Cf. A107695 (primes whose multiplicative digital root is 9), A034056 (numbers whose multiplicative digital root is 9).

Programs

  • Mathematica
    Select[Range[320000],!PrimeQ[#]&&Times@@IntegerDigits[#]==9&] (* Harvey P. Dale, Aug 27 2012 *)
Previous Showing 11-12 of 12 results.