A322821 a(1) = 0; for n > 1, a(n) = A000265(A048675(n)).

0, 1, 1, 1, 1, 3, 1, 3, 1, 5, 1, 1, 1, 9, 3, 1, 1, 5, 1, 3, 5, 17, 1, 5, 1, 33, 3, 5, 1, 7, 1, 5, 9, 65, 3, 3, 1, 129, 17, 7, 1, 11, 1, 9, 1, 257, 1, 3, 1, 9, 33, 17, 1, 7, 5, 11, 65, 513, 1, 1, 1, 1025, 3, 3, 9, 19, 1, 33, 129, 13, 1, 7, 1, 2049, 5, 65, 3, 35, 1, 1, 1, 4097, 1, 3, 17, 8193, 257, 19, 1, 9, 5, 129, 513, 16385, 33, 7, 1

Offset

1,6

Links

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

Index entries for sequences computed from indices in prime factorization

Formula

a(1) = 0; for n > 1, a(n) = A000265(A048675(n)).

Prog

(PARI)
A000265(n) = (n>>valuation(n, 2));
A048675(n) = my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; \\ From A048675
A322821(n) = if(1==n, 0, A000265(A048675(n)));

Crossrefs

Cf. A000265, A048675, A322815, A322816.

Sequence in context: A289617 A035648 A369069 * A213621 A053575 A293485

Adjacent sequences: A322818 A322819 A322820 * A322822 A322823 A322824

Keyword

nonn

Author

Antti Karttunen, Dec 27 2018

Status

approved