login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324118 Sum of odd divisors in A156552(n): a(1) = 0, for n > 1, a(n) = A000593(A156552(n)) = A000203(A322993(n)). 5
0, 1, 1, 4, 1, 6, 1, 8, 4, 13, 1, 12, 1, 18, 6, 24, 1, 14, 1, 20, 13, 48, 1, 24, 4, 84, 8, 48, 1, 32, 1, 32, 18, 176, 6, 40, 1, 258, 48, 56, 1, 38, 1, 68, 12, 800, 1, 48, 4, 31, 84, 132, 1, 30, 13, 72, 176, 1302, 1, 44, 1, 2736, 20, 104, 18, 96, 1, 304, 258, 42, 1, 72, 1, 4356, 14, 624, 6, 160, 1, 80, 24, 10928, 1, 124, 48, 20520, 800, 240, 1, 78, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

Index entries for sequences computed from indices in prime factorization

FORMULA

a(1) = 0; for n > 1, a(n) = A000593(A156552(n)) = A000203(A322993(n)) = A323243(2*A246277(n)).

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)};

A156552(n) = if(1==n, 0, if(!(n%2), 1+(2*A156552(n/2)), 2*A156552(A064989(n))));

A246277(n) = { if(1==n, 0, while((n%2), n = A064989(n)); (n/2)); };

A322993(n) = A156552(2*A246277(n));

A324118(n) = if(1==n, 0, sigma(A322993(n)));

CROSSREFS

Cf. A000203, A000593, A156552, A246277, A322819, A322993, A323243, A324117.

Sequence in context: A215619 A136706 A326478 * A100796 A005451 A135683

Adjacent sequences:  A324115 A324116 A324117 * A324119 A324120 A324121

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 20 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 November 11 22:31 EST 2019. Contains 329046 sequences. (Running on oeis4.)