Frugal

A046759

Economical

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

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

Under OEIS <a href="https://oeis.org/A046759">A046759</a>, a Frugal number has more digits
than the number of digits in its prime factorization including exponents. First 6 Frugal numbers are 	125, 128, 243, 256, 343, 512. 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

Frugal 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/A046759'>A046759</a>, a Frugal number has more digits
than the number of digits in its prime factorization including exponents. First 6 Frugal numbers are 	125, 128, 243, 256, 343, 512. Though
it doesn't matter which base we use, here we adopt only a base of 10.

Frugal numbers — Frugal

<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>

Frugal: Frugal numbers

Description

Usage

Value

Arguments

See Also

Examples