A252742 Characteristic function of A246282: if A003961(n) > 2*n, then a(n) = 1, otherwise 0 (when A003961(n) < 2*n) [where A003961(n) shifts the prime factorization of n one step towards larger primes].

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

Offset

1

Links

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

Formula

a(n) = [A003961(n) > 2*n]. (Here [ ] stands for Iverson bracket.)

Other identities. For all n >= 1:

sgn(A252748(n)) = (-1)^(1+a(n)).

Prog

(Scheme)
(define (A252742 n) (if (> (A003961 n) (* 2 n)) 1 0))
(define (A252742 n) (if (> (A048673 n) n) 1 0))

Crossrefs

Characteristic function of A246282.

Permutations: A252743, A252744.

Cf. A003961, A048673, A246260, A252748.

Sequence in context: A324883 A106002 A341612 * A066247 A151774 A095792

Adjacent sequences: A252739 A252740 A252741 * A252743 A252744 A252745

Keyword

nonn

Author

Antti Karttunen, Dec 21 2014

Status

approved