Powerful

A001694

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/A001694">A001694</a>, a Powerful number is a positive integer such that
for every prime \(p\) dividing the number, \(p^2\) also divides the number. First
6 powerful numbers are 1, 4, 8, 9, 16, 25.

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

Powerful 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/A001694'>A001694</a>, a Powerful number is a positive integer such that
for every prime \(p\) dividing the number, \(p^2\) also divides the number. First
6 powerful numbers are 1, 4, 8, 9, 16, 25.

Powerful numbers — Powerful

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

Powerful: Powerful numbers

Description

Usage

Value

Arguments

Examples