A278261 a(n) = A046523(A273671(n)).

1, 8, 2, 8, 24, 24, 2, 64, 24, 24, 192, 72, 24, 24, 4, 8, 24, 96, 24, 72, 96, 24, 72, 192, 24, 3456, 192, 24, 3456, 24, 2, 216, 192, 24, 1080, 72, 24, 8640, 576, 192, 8640, 3456, 24, 1080, 3456, 192, 1080, 120, 72, 96, 120, 24, 96, 360, 72, 576, 360, 24, 192, 120, 24, 72, 6, 8, 24, 1080, 24, 5400, 8640, 24, 72, 1080, 24, 432000, 8640, 24, 3456, 12288, 24, 120

Offset: 1

Author

Antti Karttunen, Nov 16 2016

Keywords

• nonn

Comments

This sequence works as a "sentinel" for A273671 by matching to any sequence that is obtained as f(A273671(n)), where f(n) is any function that depends only on the prime signature of n (see the index entry for "sequences computed from exponents in ..."). The only other sequence that as of Nov 11 2016 seems to match is A106347, although more terms of the latter would be needed to better ascertain whether the connection is spurious or genuine.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..16384
• Index entries for sequences computed from exponents in factorization of n

Crossrefs

Cf. A046523, A273671, A278243.

Sequences that seem to partition N into same or coarser equivalence classes: A106347

Programs

Scheme

(define (A278261 n) (A046523 (A273671 n)))

Formula

a(n) = A046523(A273671(n)).