A331169 If A122111(n) < n, then a(n) = 1, otherwise a(n) = 0.

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

Offset

1

Comments

One less than the ordinal transform of A331170.

Links

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

Index entries for characteristic functions

Index entries for sequences computed from indices in prime factorization

Formula

For all n >= 1, a(A000040(n)) = a(A088902(n)) = 0.

Prog

(PARI)
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};
A122111(n) = if(1==n, n, prime(bigomega(n))*A122111(A064989(n)));
A331169(n) = (A122111(n)<n);

Crossrefs

Cf. A000040, A088902, A122111, A331168, A331170.

Cf. also A331282.

Sequence in context: A342024 A285464 A331282 * A144602 A275855 A268310

Adjacent sequences: A331166 A331167 A331168 * A331170 A331171 A331172

Keyword

nonn

Author

Antti Karttunen, Jan 13 2020

Status

approved