cp's OEIS Frontend

In calculating terms of this sequence, use the convention that a(n)=0 for n<=0.

Much like the Hofstadter Q-sequence A005185, it is not known if this sequence is defined for all positive n.

Empirically, this sequence appears to grow approximately like n/2 with a lot of noise.

In calculating terms of this sequence, use the convention that a(n)=0 for n<=0.

Most terms in this sequence alternate between 2 and a large constant. Such runs of terms are eventually separated by either 224 or 562 other terms, and each run is approximately twice as long as the previous.

In calculating terms of this sequence, use the convention that a(n)=0 for n<=-89.

Sequences like this are more naturally considered with the first nonzero term in position 1. But this sequence would then begin with 89 terms consisting entirely of alternating 2 and 89.

This sequence has exactly 2467 terms, since a(2467)=0 and computing a(2468) would refer to itself.

In calculating terms of this sequence, use the convention that a(n)=0 for n<=-91.

Sequences like this are more naturally considered with the first nonzero term in position 1. But this sequence would then begin with 91 terms consisting entirely of alternating 2 and 91.

This sequence has exactly 375 terms, since a(375)=0 and computing a(376) would refer to itself.