A309947 a(n) = A309891(A025487(n)): For each prime signature, gives the sum of the number of trailing zeros for all bases b >= 2 for some number m with that prime signature. The prime signatures are chosen in order in which they are first seen in the positive integers.

0, 1, 3, 3, 5, 6, 8, 9, 7, 10, 11, 13, 12, 14, 15, 16, 17, 16, 21, 20, 21, 15, 21, 23, 20, 25, 27, 24, 24, 28, 28, 23, 32, 36, 29, 33, 33, 33, 35, 27, 37, 36, 38, 38, 43, 33, 43, 42, 43, 40, 29, 48, 43, 31, 51, 44, 53, 38, 52, 47, 57, 47, 35, 57, 48, 48, 66, 55, 57

Offset

1,3

Comments

A309891(n) only depends on the prime signature of n. This sequence lists the values for different prime signatures based on A025487 which lists the least positive integer for each prime signature.

Links

Table of n, a(n) for n=1..69.

Example

A309891(A025487(6)) = A309891(12) = 6.

Crossrefs

Cf. A025487, A309891.

Sequence in context: A265430 A262355 A325459 * A138373 A011976 A060022

Adjacent sequences: A309944 A309945 A309946 * A309948 A309949 A309950

Keyword

nonn,easy

Author

David A. Corneth, Aug 24 2019

Status

approved