Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


bibkey: sloane2003a005590 authors: N. J. A. Sloane; Ralf Stephan year: 2003 title: “OEIS A005590, a(0)=0, a(1)=1, a(2n)=a(n), a(2n+1)=a(n+1)-a(n)” doi: null url: https://oeis.org/A005590 claim: “%N a(0) = 0, a(1) = 1, a(2n) = a(n), a(2n+1) = a(n+1) - a(n). %F Conjecture: a(3n)=0 iff n in A003714. - Ralf Stephan, May 02 2003 N. J. A. Sloane” strata_touched:

  • D5/S1/Recurrence/StephanA005590ZeroSetCharacterization license: citation-only triage: anchor

OEIS A005590

The NAME of A005590 states:

a(0) = 0, a(1) = 1, a(2n) = a(n), a(2n+1) = a(n+1) - a(n).

The Stephan zero-set CONJECTURE is printed as:

Conjecture: a(3n)=0 iff n in A003714. - Ralf Stephan, May 02 2003

The AUTHOR line is:

N. J. A. Sloane

The AUTHOR line carries no date; the year 2003 records the date of Stephan’s conjecture. Only the zero-set equivalence is proved. Reznick’s growth-rate formula and Chai Wah Wu’s partial recurrences are untouched.

Verified locator

  • URL: https://oeis.org/A005590
  • NAME (verbatim): a(0) = 0, a(1) = 1, a(2n) = a(n), a(2n+1) = a(n+1) - a(n).
  • FORMULA conjecture line (verbatim): Conjecture: a(3n)=0 iff n in A003714. - Ralf Stephan, May 02 2003
  • AUTHOR (verbatim): N. J. A. Sloane