PerrinSequence

The Perrin sequence $3, 0, 2, 3, 2, 5, 5, 7, …$ as a lazy indexed collection.

OEISA001608↗

PerrinSequence$P_n = P_{n-2} + P_{n-3}$, $P_0 = 3$, $P_1 = 0$, $P_2 = 2$, an infinite indexed collection.

Domain: Collections

Details

• A lazy indexed collection: $Count(PerrinSequence) = +\infty$, and $At(PerrinSequence, 1) = P_0 = 3$.
• OEIS A001608, starting exactly at its offset-0 term: $3, 0, 2, 3, 2, 5, 5, 7, 10, 12, …$. The sequence dips through index 4 before climbing forever from $P_4 = 2$ on.
• Membership goes through Element: $Element(10, PerrinSequence)$ is true, $Element(4, PerrinSequence)$ is false.

Definition

Epsil, as the implementation runs it.

count()

PositiveInfinity

unrank(_r)

Fold(
      Function([wk_w[2], wk_w[3], wk_w[1] + wk_w[2]], wk_w, wk_n),
      [3, 0, 2],
      Range(0, _r - 1, 1),
    )[1]

rank(_x)

Fold(
      Function(
                wk_w if wk_n >= 4 && wk_w[1] > _x else [
                                                         wk_w[2],
                                                         wk_w[3],
                                                         wk_w[1] + wk_w[2],
                                                         wk_n if wk_w[4] < 0 &&
                                                                 wk_w[1] == _x else wk_w[4],
                                                       ],
                wk_w,
                wk_n,
              ),
      [3, 0, 2, -1],
      Range(
             0,
             3 * (Apply(
                         (fl_r: list<integer>) => fl_r[2],
                         Fold(Function(
                                        [
                                          (fl_s[1] - fl_s[1] % 2 ^ fl_k) / 2 ^
                                                                           fl_k,
                                          fl_s[2] + fl_k,
                                        ] if fl_s[1] >= 2 ^ fl_k else fl_s,
                                        fl_s,
                                        fl_k,
                                      ), [_x + 2, 0], [
                                                       8_192,
                                                       4_096,
                                                       2_048,
                                                       1_024,
                                                       512,
                                                       256,
                                                       128,
                                                       64,
                                                       32,
                                                       16,
                                                       8,
                                                       4,
                                                       2,
                                                       1,
                                                     ]),
                       ) + 1) + 12,
             1,
           ),
    )[4] if _x >= 0 else -1

valid(_x)

Fold(
      Function(
                wk_w if wk_n >= 4 && wk_w[1] > _x else [
                                                         wk_w[2],
                                                         wk_w[3],
                                                         wk_w[1] + wk_w[2],
                                                         wk_n if wk_w[4] < 0 &&
                                                                 wk_w[1] == _x else wk_w[4],
                                                       ],
                wk_w,
                wk_n,
              ),
      [3, 0, 2, -1],
      Range(
             0,
             3 * (Apply(
                         (fl_r: list<integer>) => fl_r[2],
                         Fold(Function(
                                        [
                                          (fl_s[1] - fl_s[1] % 2 ^ fl_k) / 2 ^
                                                                           fl_k,
                                          fl_s[2] + fl_k,
                                        ] if fl_s[1] >= 2 ^ fl_k else fl_s,
                                        fl_s,
                                        fl_k,
                                      ), [_x + 2, 0], [
                                                       8_192,
                                                       4_096,
                                                       2_048,
                                                       1_024,
                                                       512,
                                                       256,
                                                       128,
                                                       64,
                                                       32,
                                                       16,
                                                       8,
                                                       4,
                                                       2,
                                                       1,
                                                     ]),
                       ) + 1) + 12,
             1,
           ),
    )[4] >= 0 if _x >= 0 else False

Enumeration

Examples

1 more kept as data, checked against the oracles

About

Examples	1
Crosswalk	OEIS

See also: Count, At, Element, PadovanSequence