A101403 Number of times that n occurs in A101402.

1, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 4, 3, 2, 4, 3, 2, 3, 3

Offset: 0

Author

Odimar Fabeny, Jan 16 2005

Keywords

• easy
• nonn

Comments

First differences of A246439; see A246431 for smallest m such that a(m)=n; a(A129117(n)) = 5. - Reinhard Zumkeller, Aug 28 2014

Links

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

Crossrefs

Cf. A101402, A246431, A246439.

Programs

Haskell

import Data.List (group)
a101403 n = a101403_list !! n
a101403_list = map length $ group a101402_list
-- Reinhard Zumkeller, Aug 27 2014

Mathematica

A101402[0] = 0; A101402[1] = 1;
A101402[n_] := A101402[n] = A101402[2^(Floor[Log[2, n - 1]])] + A101402[n - 1 - 2^(Floor[Log[2, n - 1]])]; TheList = Table[A101402[i], {i, 0, 279}];
A101403 = Table[Count[TheList, i], {i, 0, Last[TheList]}]
(* Keith Schneider, May 25 2007 *)

Formula

a(n) > 1 for all n > 0, see comment in A101402. - Charles R Greathouse IV, Sep 10 2014

Extensions

More terms from Keith Schneider, May 25 2007