A324819 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A324819

a(n) = 2*A156552(n) OR A323243(n), where OR is bitwise-OR, A003986.

0, 3, 7, 6, 15, 14, 31, 14, 12, 31, 63, 30, 127, 50, 22, 30, 255, 30, 511, 54, 39, 114, 1023, 62, 28, 214, 28, 118, 2047, 42, 4095, 62, 118, 434, 42, 62, 8191, 770, 148, 126, 16383, 110, 32767, 198, 44, 1826, 65535, 126, 60, 63, 508, 390, 131071, 62, 91, 206, 532, 3350, 262143, 126, 524287, 6834, 124, 126, 254, 234, 1048575, 822

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

OFFSET

1,2

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(A000040(n)) = A000225(1+n).

PROG

(PARI)

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

A324819(n) = bitor(2*A156552(n), A323243(n)); \\ Needs code also from A323243.

CROSSREFS

Cf. A003986, A156552, A323243, A324815, A324821.

Sequence in context: A095360 A175142 A318466 * A217112 A241016 A245602

Adjacent sequences: A324816 A324817 A324818 * A324820 A324821 A324822

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 18 2019

STATUS

approved