Extravagant

A046760

Wasteful

Under OEIS <a href="https://oeis.org/A046760">A046760</a>, an Extravagant number has less digits
than the number of digits in its prime factorization including exponents. First 6 Extravagant numbers are 	4, 6, 8, 9, 12, 18. Though
it doesn't matter which base we use, here we adopt only a base of 10.

Generates well-known integer sequences. 'gmp' package is adopted for computing with arbitrarily large numbers. Every function has hyperlink to its corresponding item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306).

Kisung You

Zseq

Integer Sequence Generator

Extravagant function

<dl><dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>
<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd></dl>

Arguments

Under OEIS <a href='https://oeis.org/A046760'>A046760</a>, an Extravagant number has less digits
than the number of digits in its prime factorization including exponents. First 6 Extravagant numbers are 	4, 6, 8, 9, 12, 18. Though
it doesn't matter which base we use, here we adopt only a base of 10.

Extravagant numbers — Extravagant

<dl>

<dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>


<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd>

</dl>

Extravagant: Extravagant numbers

Description

Usage

Value

Arguments

See Also

Examples