login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324575 a(1) = 0; for n > 1, a(n) = A033879(A048675(n)). 6
0, 1, 1, 1, 1, 2, 1, 2, 1, 4, 1, 1, 1, 5, 0, 1, 1, 4, 1, 0, 2, 16, 1, 4, 1, 18, 0, 2, 1, 6, 1, 4, -3, 46, -4, 0, 1, 82, 14, 6, 1, 10, 1, -3, 1, 256, 1, 0, 1, 5, -12, 14, 1, 6, -2, 10, 8, 226, 1, 1, 1, 748, -4, 0, -19, 18, 1, -12, -12, 12, 1, 6, 1, 1362, 2, 8, -12, 22, 1, 1, 1, 3838, 1, -4, 10, 5458, 254, 18, 1, 5, -10, -12, -348, 12250 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

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(1) = 0; for n > 1, a(n) = A033879(A048675(n)).

a(n) = 2*A048675(n) - A324573(n).

a(A007947(n)) = A324574(n).

a(p) = 1 for all primes p.

PROG

(PARI)

A033879(n) = (2*n-sigma(n));

A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; };

A324575(n) = if(1==n, 0, A033879(A048675(n)));

CROSSREFS

Cf. A007947, A033879, A048675, A324573, A324574.

Cf. also A323244, A323174, A324546.

Sequence in context: A225765 A300588 A030359 * A035400 A235918 A071222

Adjacent sequences:  A324572 A324573 A324574 * A324576 A324577 A324578

KEYWORD

sign

AUTHOR

Antti Karttunen, Mar 07 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 30 16:16 EDT 2020. Contains 333127 sequences. (Running on oeis4.)