A324870 - OEIS

A324870

a(n) = A324863(n) - A252464(n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

COMMENTS

Question: Are there any other terms than 0's and 1's ? There are only 201 nonzero values among the first 10000 terms and they are all 1's.

A324871 gives the numbers n where a(n) <> 0. The first such number which is not a square is 187 = 11*17.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to sigma(n)

FORMULA

a(n) = A324863(n) - A252464(n).

PROG

(PARI)

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));

A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552

A252464(n) = if(1==n, 0, (bigomega(n) + A061395(n) - 1));

A324866(n) = { my(k=A156552(n)); bitor(k, (A323243(n)-k)); }; \\ Needs also code from A323243.

A324863(n) = #binary(A324866(n));

A324870(n) = (A324863(n) - A252464(n));

CROSSREFS

Cf. A156552, A252464, A324863, A324866, A324871, A324872.

Sequence in context: A023975 A305821 A305892 * A011738 A011737 A011736

Adjacent sequences: A324867 A324868 A324869 * A324871 A324872 A324873

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 21 2019

STATUS

approved