A336120 a(n) = A292383(A122111(n)).

0, 0, 0, 1, 0, 2, 0, 2, 0, 4, 0, 4, 0, 8, 0, 5, 0, 5, 0, 8, 0, 16, 0, 10, 1, 32, 0, 16, 0, 10, 0, 11, 0, 64, 2, 8, 0, 128, 0, 20, 0, 20, 0, 32, 0, 256, 0, 22, 0, 8, 0, 64, 0, 11, 4, 40, 0, 512, 0, 16, 0, 1024, 0, 22, 8, 40, 0, 128, 0, 16, 0, 20, 0, 2048, 1, 256, 0, 80, 0, 44, 0, 4096, 0, 32, 16, 8192, 0, 80, 0, 22, 0, 512, 0, 16384, 32, 44, 0, 17, 0, 17, 0

Offset

1,6

Links

Antti Karttunen, Table of n, a(n) for n = 1..8192

Index entries for sequences computed from indices in prime factorization

Formula

a(1) = 0, and for n > 1, a(n) = [A122111(n) == 3 (mod 4)] + 2*a(A253553(n)).

a(n) = A292383(A122111(n)).

a(n) = A253566(n) - A336125(n).

A000120(a(n)) = A336121(n).

Prog

(PARI)
\\ Uses also code given in A336124:
A253553(n) = if(n<=2, 1, my(f=factor(n), k=#f~); if(f[k, 2]>1, f[k, 2]--, f[k, 1] = precprime(f[k, 1]-1)); factorback(f));
A336120(n) = if(1==n, 0, (3==A336124(n))+(2*A336120(A253553(n))));

Crossrefs

Cf. A064989, A122111, A252463, A253553, A253566, A292383, A336121, A336124, A336125, A336312.

Cf. A336119 (positions of zeros).

Sequence in context: A167156 A132952 A319998 * A029187 A201863 A035385

Adjacent sequences: A336117 A336118 A336119 * A336121 A336122 A336123

Keyword

nonn

Author

Antti Karttunen, Jul 14 2020

Status

approved