Happy

A007770

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/A007770">A007770</a>, a Happy number is defined by the process that starts from
arbitrary positive integer and replaces the number by the sum of the squares of each digit until the number is 1.
First 6 Happy numbers are 1, 7, 10, 13, 19, 23.

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

Happy 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/A007770'>A007770</a>, a Happy number is defined by the process that starts from
arbitrary positive integer and replaces the number by the sum of the squares of each digit until the number is 1.
First 6 Happy numbers are 1, 7, 10, 13, 19, 23.

Happy numbers — Happy

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

Happy: Happy numbers

Description

Usage

Value

Arguments

Examples