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.

A061984 a(n) = 1 + a([n/2]) + a([n/3]) with a(0) = 0.

Original entry on oeis.org

0, 1, 2, 3, 4, 4, 6, 6, 7, 8, 8, 8, 11, 11, 11, 11, 12, 12, 15, 15, 15, 15, 15, 15, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 32, 32, 32, 32, 32, 32, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 37, 37, 37, 37, 37, 37, 37, 37, 47
Offset: 0

Views

Author

Henry Bottomley, May 24 2001

Keywords

Comments

If n = 2^a*3^b, then a(n)-a(n-1) = C(a+b, a). - David Wasserman, Nov 17 2005

Crossrefs

Programs

  • Haskell
    a061984 n = a061984_list !! n
    a061984_list = 0 : map (+ 1) (zipWith (+)
       (map (a061984 . (`div` 2)) [1..]) (map (a061984 . (`div` 3)) [1..]))
    -- Reinhard Zumkeller, Jan 11 2014