A373096 a(n) = a([n/9]) + a([n/27]) + a([n/81]) + ..., where a(0) = 0, a(1) = 1, and [ ] = floor().

0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2

Offset

0,82

Comments

Every term is a Fibonacci number, and every positive Fibonacci number occurs.

Links

Table of n, a(n) for n=0..85.

Formula

Following the first 3^2 terms (all zeros and ones): 3^2 ones, 3^2 zeros, 3^3 ones, 3^3 zeros, 3^4 twos, 3^4 zeros, 3^5 threes, 3^5 zeros, 3^6 fives, 3^6 zeros, etc.

Maple

A373096 := proc(n)
    option remember;
    if n <=1 then
        n;
    else
        add( procname(floor(n/3^k)), k=2..n) ;
    end if;
end proc:
seq(A373096(n), n=0..100) ; # R. J. Mathar, Jun 07 2024

Mathematica

a[0] = 0; a[1] = 1;
a[n_] := a[n] = Sum[a[Floor[n/3^k]], {k, 2, n}]
Table[a[n], {n, 0, 570}]

Prog

(PARI) a(n) = if (n<=1, n, sum(k=2, n, a(n\3^k))); \\ Michel Marcus, Jun 01 2024

Crossrefs

Cf. A000045, A000244, A373095, A373097.

Sequence in context: A114294 A371929 A242050 * A037869 A037868 A173069

Adjacent sequences: A373093 A373094 A373095 * A373101 A373102 A373103

Keyword

nonn

Author

Clark Kimberling, May 31 2024

Status

approved