A322375 a(n) = A318366(A025487(n)).

0, 0, 1, 2, 4, 8, 10, 20, 12, 20, 24, 40, 34, 35, 52, 70, 72, 56, 95, 84, 112, 48, 104, 130, 84, 156, 164, 168, 116, 180, 212, 120, 238, 280, 240, 224, 284, 189, 322, 165, 304, 344, 258, 300, 438, 330, 380, 420, 348, 464, 220, 500, 477, 160, 472, 460, 644, 440, 592

Offset: 1

Author

David A. Corneth, Jan 12 2019

Keywords

• nonn

Comments

A318366(n) computes a sum over the divisors of n in such a way that A318366(n) only depends on the prime signature of n. A025487 lists least numbers with a given prime signature with the exponents in nonincreasing order. This sequence hence shows this sum over divisors for distinct prime signatures.

Examples

			a(8) = A318366(A025487(8)) = A318366(24) = 20 (See example of finding A318366 at that sequence).
		

Links

• David A. Corneth, Table of n, a(n) for n = 1..24112

Crossrefs

Cf. A025487, A318366.