A353492 a(1) = 0, and for n > 1, a(n) = 1 if the largest proper divisor of n is of the form 4k+3, otherwise 0.

0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1

Offset

1

Links

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

Index entries for characteristic functions

Formula

a(n) = 1 iff A353490(n) = 3, otherwise 0.

Prog

(PARI)
A032742(n) = if(1==n, n, n/vecmin(factor(n)[, 1]));
A353492(n) = (3==(A032742(n)%4));

Crossrefs

Cf. A032742, A353490, A353491.

Sequence in context: A280046 A169672 A011672 * A202238 A144194 A144196

Adjacent sequences: A353489 A353490 A353491 * A353493 A353494 A353495

Keyword

nonn

Author

Antti Karttunen, Apr 22 2022

Status

approved