login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A278043
Number of 1's in tribonacci representation of n (cf. A278038).
11
0, 1, 1, 2, 1, 2, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 4, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 3, 4, 4, 5, 4, 5, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4
OFFSET
0,4
LINKS
FORMULA
a(n) = A000120(A003726(n+1)). - John Keith, May 23 2022
MATHEMATICA
t[1] = 1; t[2] = 2; t[3] = 4; t[n_] := t[n] = t[n - 1] + t[n - 2] + t[n - 3]; a[0] = 0; a[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[t[k] <= m, k++]; k--; AppendTo[s, k]; m -= t[k]; k = 1]; DigitCount[Total[2^(s - 1)], 2, 1]]; Array[a, 100, 0] (* Amiram Eldar, Mar 04 2022 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Nov 18 2016
STATUS
approved