Skip to content

AllOnes ​

The constant sequence 1,1,1,…1, 1, 1, … as a lazy indexed collection.

AllOnesthe constant 11, repeated forever.

Domain: Collections

Details
  • A lazy indexed collection: Count(AllOnes)=+∞Count(AllOnes) = +\infty, and At(AllOnes,k)=1At(AllOnes, k) = 1 for every kk.
  • OEIS A000012.
  • A repeated-term collection: every position holds the same value, so AtAt still indexes by position while Element answers membership in the set of values -- Element(1,AllOnes)Element(1, AllOnes) is true, Element(2,AllOnes)Element(2, AllOnes) is false.

Definition

Epsil, as the implementation runs it.

count()

PositiveInfinity

unrank(_r)

1

rank(_x)

0

valid(_x)

_x == 1

Enumeration

Examples

1 more kept as data, checked against the oracles
Properties #
live ↗
In1∈AllOnes1∈\mathrm{AllOnes}OutTrue\mathrm{True}
live ↗
In2∈AllOnes2∈\mathrm{AllOnes}OutFalse\mathrm{False}
About
Examples3
CrosswalkOEIS

See also: Count, At, Element