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

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,3

Comments

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

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Prog

(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

Crossrefs

Cf. A061980, A061985, A061986, A061987.

Cf. A007731.

Sequence in context: A160680 A243069 A342496 * A337125 A063208 A343912

Adjacent sequences: A061981 A061982 A061983 * A061985 A061986 A061987

Keyword

nonn

Author

Henry Bottomley, May 24 2001

Status

approved