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-3 of 3 results.

A070566 "Compact" numbers: see reference for definition.

Original entry on oeis.org

2, 3, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 53, 57, 59, 61, 67, 71, 73, 79, 83, 87, 89, 93, 97, 101, 103, 107, 109, 113, 117, 121, 127, 131, 137, 139, 145, 149, 151, 157, 163, 167, 169, 173, 177, 179, 181, 189, 191, 193, 197, 199
Offset: 1

Views

Author

N. J. A. Sloane, Sep 22 2008

Keywords

Comments

The old entry with this sequence number was a duplicate of A062329.

Crossrefs

A145555 "Trim" numbers that are not prime; see reference for definition.

Original entry on oeis.org

27, 125, 147, 189, 539, 625, 875, 1029, 1925, 2025, 2187, 2499, 3159, 3249, 3757, 4125, 4199, 4719, 4851, 5145, 5733, 5775, 6517, 6561, 6615, 7203, 8415, 8775, 10005, 10125, 10557, 10829, 10935, 11025, 12005, 13365, 14365, 15435, 15625, 15717
Offset: 1

Views

Author

Ray Chandler, Oct 13 2008

Keywords

Crossrefs

Cf. A079603.

A279070 Compact numbers: numbers that can be expressed more compactly using their prime factorization than their decimal expansion.

Original entry on oeis.org

2187, 2401, 3125, 6561, 12167, 14641, 15625, 16384, 16807, 19683, 24389, 28561, 29791, 32768, 50653, 59049, 65536, 68921, 78125, 79507, 83521, 100489, 103823, 109375, 109561, 113569, 117649, 120409, 121801, 124609, 128881, 130321, 131072, 134689, 137781
Offset: 1

Views

Author

Jon E. Schoenfield, Dec 25 2016

Keywords

Comments

For any number k > 1, write its "compact prime factorization", with no spaces, as p1^e1*p2^e2*...*pj^ej, where p1, p2, ..., pj are the distinct prime factors of k and e1, e2, ..., ej are their respective exponents, but omit each exponent whose value is 1 (along with its caret character "^"). Sequence gives those numbers k whose compact prime factorization has fewer characters than k has decimal digits.
The smallest term other than a prime power is 109375 = 5^6*7.
The smallest term that is a power of 10 is 10000000 = 2^7*5^7.
The smallest term that is a factorial is 45!
= 119622220865480194561963161495657715064383733760000000000
= 2^41*3^21*5^10*7^6*11^4*13^3*17^2*19^2*23*29*31*37*41*43.
Includes 2^k for k >= 14, 3^k for k >= 7, 5^k for k >= 5, 7^k for k >= 4. - Robert Israel, Dec 26 2016
Let k'(b) be the smallest k such that b^k is included; then the sequence k'(2), k'(3), k'(4), ... begins {14, 7, 7, 5, 9, 4, 5, 4, 7, 4, 8, 4, 7, 6, 4, 4, 7, 4, 7, 6, 6, 3, 6, 3, ...} (with the larger values generally occurring where b has more than one prime divisor). It appears that b^k is included for all b > 1 and all k >= k'(b) with only two exceptions: although 6^k'(6) = 6^9 = 10077696 = 2^9*3^9 and 6^12 = 2176782336 = 2^12*3^12 are included, 6^10 = 60466176 = 2^10*3^10 and 6^11 = 362797056 = 2^11*3^11 are not. - Jon E. Schoenfield, Dec 26 2016
Note that there is another class of numbers that are called "Compact". See the definition in A169661. See also the links from T. M. Apostol and from V. Shevelev in the same entry. See also A070566 and A145554. - Omar E. Pol, Dec 26 2016

Examples

			The number 2187 = 3^7 can be written more compactly as "3^7" (3 characters) than as "2187" (4 characters), so 2187 is in the sequence.
		

Crossrefs

Programs

  • Maple
    filter:=  proc(n) local F,t;
        F:= ifactors(n)[2];
        nops(F)-2+add(ilog10(t[1])+1+`if`(t[2]=1,0,2+ilog10(t[2])),t=F)Robert Israel, Dec 26 2016
Showing 1-3 of 3 results.