cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A095901 A004001 (mod 2).

Original entry on oeis.org

1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0
Offset: 1

Views

Author

Robert G. Wilson v, Jun 12 2004

Keywords

Crossrefs

Cf. A095902 (number of odd entries less than or equal to 2^n).
Cf. A283480 (partial sums).
Characteristic function of A283481.

Programs

  • Mathematica
    a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Table[ a[n], {n, 105}]
  • Scheme
    (define (A095901 n) (A000035 (A004001 n))) ;; Further code found under those two entries, Antti Karttunen, Mar 21 2017

Formula

a(n) = A004001(n) mod 2.

A283480 Partial sums of A095901.

Original entry on oeis.org

1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 11, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 15, 16, 16, 17, 17, 17, 18, 18, 18, 19, 20, 21, 21, 22, 23, 23, 23, 23, 24, 25, 26, 27, 27, 27, 27, 27, 27, 27, 28, 28, 29, 29, 30, 30, 30, 31, 31, 32, 32, 32, 33, 33, 34, 35, 35, 36, 37, 37, 37, 37, 38, 38, 39, 40, 40, 41
Offset: 1

Views

Author

Antti Karttunen, Mar 18 2017

Keywords

Crossrefs

The least monotonic left inverse of A283481.

Programs

Formula

a(1) = 1; for n > 1, a(n) = A095901(n) + a(n-1).
Other identities. For all n >= 1:
a(A283481(n)) = n.
a(2^n) = A095902(n).
Showing 1-2 of 2 results.