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.

A227740 Integers from 0 to A037834(n) followed by integers from 0 to A037834(n+1) and so on.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 3
Offset: 1

Views

Author

Antti Karttunen, Jul 25 2013

Keywords

Comments

Equivalently, integers from 0 to A005811(n)-1 followed by integers from 0 to A005811(n+1)-1 and so on.

Crossrefs

Programs

  • Mathematica
    Table[Range[0, #] &@ Total@ Flatten@ Map[Abs@ Differences@ # &,
    Partition[IntegerDigits[n, 2], 2, 1]], {n, 34}] // Flatten (* Michael De Vlieger, May 09 2017 *)
  • Scheme
    (define (A227740 n) (- n (+ 1 (A173318 (- (A227737 n) 1)))))

Formula

a(n) = n - (1 + A173318(A227737(n)-1)).